zoukankan      html  css  js  c++  java
  • 【Leetcode】Palindrome Number

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

    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.

    方法一:先将数字反转,比较反转前后是否相等。但这种方法反转时可能发生溢出。

     1 class Solution {
     2 public:
     3     bool isPalindrome(int x) {
     4         if (x < 0) {
     5             return false;
     6         }
     7         return x == reverse(x);
     8     }
     9 private:
    10     int reverse(int x) {
    11         unsigned ret = 0;
    12         while (x) {
    13             ret = ret * 10 + x % 10;
    14             x /= 10;
    15         }
    16         return ret;
    17     }    
    18 };

    方法二:逐位比较。

     1 class Solution {
     2 public:
     3     bool isPalindrome(int x) {
     4         if (x < 0) {
     5             return false;
     6         }
     7         int d = 1;
     8         while (x / d >= 10) {
     9             d *= 10;
    10         }
    11         
    12         while (x > 0) {
    13             if (x / d != x % 10) {
    14                 return false;
    15             }
    16             x = x % d / 10;
    17             d = d / 100;
    18         }
    19         return true;
    20     }
    21 };
  • 相关阅读:
    练习三
    练习四
    练习二
    软件生命周期
    练习一 第六题
    练习一 第五题
    练习一 第四题
    练习一 第三题
    练习一 第二题
    AngularJs模块
  • 原文地址:https://www.cnblogs.com/dengeven/p/4009471.html
Copyright © 2011-2022 走看看