标签：style blog http color io ar strong div sp
Determine whether an integer is a palindrome. Do this without extra space.
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.
思路很简单，只要把这个数字逆序就行了 123--》321 ，如果回文，必然相等
翻了翻自己以前写的逆序代码，有点sb，不过思想是对的，代码简洁性有待提高啊
1 public boolean isPalindrome(int x) { 2 //caculate the reverse of an integer 123 --> 321 3 int reverse = 0; 4 int temp = x; 5 if(x < 0){ 6 return false; 7 } 8 while(temp > 0){ 9 reverse = reverse * 10 + temp%10; 10 temp = temp / 10; 11 } 12 return reverse == x; 13 }
标签：style blog http color io ar strong div sp
原文地址：http://www.cnblogs.com/dijkstra-c/p/3967155.html
