Leetcode学习笔记:#5. Longest Palindromic Substring
Given a 32-bit signed integer, reverse digits of an integer.
实现:
public int reverse(int x){
long rev = 0;
while(x != 0){
rev = rev*10 + x %10;
x = x/10;
if(rev > Integer.MAX_VALUE || rev < Integer.MIN_VALUE){
return 0;
}
}
return (int) rev;
}
思路:
循环,每次循环取x的个位数(除以10的余数)当作rev的最高位数,x再除以10进入下次循环。