BEAKJOON JAVA ALGORITHM #1107(리모콘)

https://www.acmicpc.net/problem/1107

import java.util.Scanner; public class a1107 { static boolean[] wNum = new boolean[10]; public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int wCnt = sc.nextInt(); for(int i=0 ; i<wCnt ; i++) { wNum[sc.nextInt()] = true; //고장난 리모콘 } int result = num - 100; if(result < 0) { result = -result; //절대값 } for(int i=0; i<=1000000; i++) { int c = i; int len = len(c); if(len > 0) { int press = c - num; if(press < 0) { press = -press; //절대값 } if(result > len + press) { result = len + press; } } } System.out.println(result); } public static int len(int num) { if(num == 0) { if(wNum[0] == true) { return 0; }else { return 1; } } int len = 0; while(num > 0) { if(wNum[num % 10] == true) { return 0; } len++; num = num / 10; } return len; } }