首页

源码搜藏网

首页 > 开发教程 > 软件工程 >

【Leetcode】Palindrome Number

创建时间:2016-06-06 23:26  

题目链接:https://leetcode.com/problems/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.

思路:

easy

算法:

[java] view plain copy  【Leetcode】Palindrome Number【Leetcode】Palindrome Number
  1. public boolean isPalindrome(int x) {  
  2.     String s = String.valueOf(x);  
  3.     for(int i=0;i<s.length()/2;i++){  
  4.         if(s.charAt(i)!=s.charAt(s.length()-1-i))  
  5.             return false;  
  6.     }  
  7.     return true;  
  8. }  


0
0
   
上一篇:【Leetcode】Reverse Integer
下一篇:【Leetcode】Ugly Number

相关内容

热门推荐