zoukankan      html  css  js  c++  java
  • [Leetcode] Palindrome Number

    Determine whether an integer is a palindrome. Do this without extra space.

    click to show spoilers.

    Some hints:

    Could negative integers be palindromes? (ie, -1)

    If you are thinking of converting the integer to string, note the restriction of using extra space.

    You could also try reversing an integer. However, if you have solved the problem "Reverse Integer", you know that the reversed integer might overflow. How would you handle such case?

    There is a more generic way of solving this problem.

    Solution:

    题意判断数字是否是回文串,只能用常数空间,不能转换成字符串,不能反转数字。

    先计算数字的位数,分别通过除法和取余,提取出要对比的对应数字。

     1 public class Solution {
     2     public boolean isPalindrome(int x) {
     3         if(x<0)
     4             return false;
     5         if(x==0)
     6             return true;
     7         int base=1;
     8         while(x/base>=10)
     9             base*=10;
    10         while(x>0){
    11             int first=x/base;             //left digit
    12             int last=x%10;                //right digit
    13             if(first!=last)
    14                 return false;
    15             x=(x-first*base)/10;          //get number between first and last  
    16             base/=100;
    17         }
    18         return true;
    19     }
    20 }
  • 相关阅读:
    触发器
    累加求和存储过程
    check约束条件
    数据库的备份还原
    创建万能分页
    视图
    进销存存储过程
    函数存储过程
    数据库作业27~45
    数据库作业17~26
  • 原文地址:https://www.cnblogs.com/Phoebe815/p/4052055.html
Copyright © 2011-2022 走看看