两个算法--Day7



/*
 * 1.Reverse digits of an integer.
     Example1: x = 123, return 321
     Example2: x = -123, return -321
     Note:
     The input is assumed to be a 32-bit signed integer.
     Your function should return 0 when the reversed integer overflows.
     2.Determine whether an integer is a palindrome. Do this without extra space.
    
 */
package algorithm;

public class Day7 {

 public static void main(String[] args) {
  // TODO Auto-generated method stub
  Solution7 sl7=new Solution7();
  int result1=sl7.revDig1(2147483641);
  System.out.println("转换结果为： "+result1);
  boolean result2=sl7.isPalindrome(12321);
  System.out.println("是否为回文： "+result2);

 }

}
class Solution7
{
 
 public int revDig1(int x)
 {
  int result = 0;

     while (x != 0)
     {
         int tail = x % 10;
         int newResult = result * 10 + tail;
         if ((newResult - tail) / 10 != result)
         { return 0; }
         result = newResult;
         x = x / 10;
     }

     return result;
 }
 public boolean isPalindrome(int num)
 {
  if(num<0||(num!=0&&num%10==0))
  {return false;}
  int res=0;
  while(num>res)
  {
   res=res*10+num%10;
   num=num/10;
  }
  return(num==res||num==res/10);
 }
}