[SW Expert Academy] 화섭이의 정수 나열 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWHz7xD6A20DFAVB&categoryId=AWHz7xD6A20DFAVB&categoryType=CODE&problemTitle=%EC%A0%95%EC%88%98+%EB%82%98%EC%97%B4&orderBy=PASS_RATE&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=1

SW Expert Academy

 

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {

			int n = sc.nextInt();

			StringBuilder sb = new StringBuilder();

			for (int i = 0; i < n; i++) {
				sb.append(sc.next());
			}

			//System.out.println(sb);

			int index = 0;

			while (true) {
				if (!sb.toString().contains(Integer.toString(index))) {
					break;
				}
				index++;
			}

			System.out.println("#" + tc + " " + index);
		}

	}
}

 

입력한 값을 합쳐놓은 StringBuilder에서

index를 0부터 시작하여 1씩 증가해가며 StringBuilder가 그 값을 포함하는지 포함하지 않는지  찾아보는 식으로 풀이했다