回文数

package com.gem.homework;

import java.util.Scanner;

public class T9Palindromes {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		// 输入所需回文数范围
		Scanner scan = new Scanner(System.in);
		System.out.println("请输入初始数字 ：");
		int startNum = scan.nextInt();
		System.out.println("请输入结束数字 ：");
		int endingNum = scan.nextInt();

		for (int k = startNum; k < endingNum; k++) {
			int index = getDigit(k);
			int[] arr = new int[index];
			int m = getReversalNumber(k, arr);
			// 判断所给数是否是回文数
			if (k == m) {
				System.out.println(k);
			}
		}
		scan.close();
	}

	// 返回所给数的位数
	static int getDigit(int n) {
		int m = 0;
		while (n != 0) {
			n = n / 10;
			m++;
		}
		return m;
	}

	// 返回所给数的倒序排列
	static int getReversalNumber(int n, int[] w) {
		int s = 0;
		int i;
		for (i = 0; i < w.length; i++) {
			w[i] = n % 10;
			n = n / 10;
			s = s + (int) (w[i] * Math.pow(10, w.length - i - 1));
		}
		return s;
	}

}