当前位置:首页 > 开发教程 > 软件工程 >

【Leetcode】Palindrome Number

时间:2016-06-06 23:26 来源: 作者: 收藏

Linux系统提供API函数sched_setaffinity和sched_getaffinity用于设置或获取线程的可以使用的CPU核。int sched_setaffinity(pid_t pid, unsigned int cpusetsize, cpu_set_t *mask);这个函数中pid表示需要设置或获取绑定信息的线程id(或进程id),如果为0,表

题目链接: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