特殊回文数-Java

package cn.slxy.suanfa;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class HuiWenShu {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int num = in.nextInt();
        List<Integer> list = new ArrayList<Integer>();
        for (int i = 10000; i < 999999; i++) {
            if (isHuiWen(i)) {
                int sum = sum(i);
                if (num == sum) {
                    list.add(i);
                }
            }
        }
        for (Integer integer : list) {
            System.out.println(integer);
        }
    }
    private static boolean isHuiWen(int i) {
        String valueOf = String.valueOf(i);
        char[] array = valueOf.toCharArray();
        int num = array.length / 2;
        for (int j = 0; j < num; j++) {
            if (array[j] == (array[array.length - j - 1]))
                continue;
            else
                return false;
        }
        return true;
    }
    private static int sum(int i) {
        int sum = 0;
        int h1 = i;
        int h2 = i / 10;
        int h3 = i / 100;
        if (i >= 100000) {
            sum = (h1 + h2 + h3) * 2;
        } else {
            sum = (h1 + h2) * 2 + h3;
        }
        return sum;
    }
}