Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
代码:
package leetCode;
import java.util.ArrayList;
public class ReverseInteger {
public int pow(int num,int N){ //这个函数的作用是计算某个数的几次方
if(N==0){
return 1;
}
else if(N==1){
return num;
}
else{
return num*pow(num,N-1);
}
}
public int reverse(int x) {
ArrayList<Integer> al = new ArrayList<>();
int s = x;
int count=0;
int i = 0;
int max=0;
while(s!=0){ //这个循环算出这个整数是几位数
s = s/10;
count++;
}
while(x!=0){ //这个循环把整数的每位数存入ArrayList
int c=x%10;
al.add(c);
x=x/10;
}
while(i<al.size()){ //这个循环算出反向整数
max = al.get(i)*pow(10,count-1)+max; //把ArrayList里面各位数分别乘以10的几次方,然后加起来
count--;
i++;
}
return max;
}
public static void main(String[] args) {
int a=new ReverseInteger().reverse(0);
System.out.println(a);
}
}