从大于等于N 的正整数里找到一个最小的数M,使之满足:M和M的逆序数(如1230的逆序数为321)的和为一个[100000,200000]区间内的值。
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int M = N;
while(true) {
int reverse = getReverse(M);
if(Math.abs(M - reverse) >= 100000 && Math.abs(M - reverse) <= 200000) break;
else M++;
}
System.out.println(M);
}
public static int getReverse(int x)
{
int res = 0;
while(x != 0) {
int temp = x % 10;
res = res * 10 + temp;
x /= 10;
}
return res;
}
}