백준 알고리즘 풀이(15596번)

public class P15596 {
    public static void main(String[] args) {
        int nowNum = 1;

        List<Integer> makedNumList = new ArrayList<>();

        int makedNum = 0;
        while (nowNum <= 10000){
            makedNum = getMakedNum(nowNum);
            makedNumList.add(makedNum);
            nowNum++;
        }

        nowNum = 1;
        while (nowNum <= 10000){
            if(!makedNumList.contains(nowNum)){
                System.out.println(nowNum);
            }

            nowNum++;
        }
    }

    private static int getMakedNum(final int num){
        int makedNum = 0;
        int calNum = num;

        makedNum += calNum;
        while(calNum > -1){
            makedNum += calNum % 10;
            calNum = calNum / 10 == 0 ? -1 : calNum / 10;
        }

        return makedNum;
    }
}