[백준-4673번/Java] 셀프 넘버

* 브루트포스 알고리즘; 완전탐색

public class Main {

	public static void main(String[] args) {

		int[] selfNums = new int[10001];
		selfNums[0] = -1;
		for (int i = 1; i <= 10000; i++) {
			selfNums[i] = i;
		}

		for (int i = 1; i <= 10000; i++) {
			int num = i;
			int selfNum = i;
			while (true) {
				selfNum += num % 10;
				if (num / 10 == 0)
					break;
				num /= 10;
			}
			if (selfNum <= 10000)
				selfNums[selfNum] = -1;
		}

		for (int i : selfNums) {
			if (i != -1) {
				System.out.println(i);
			}
		}
	}

}