[SW Expert Academy] 순열1 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AXHx23oq0REDFAXR&categoryId=AXHx23oq0REDFAXR&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=JAVA&select-1=3&pageSize=10&pageIndex=13

SW Expert Academy

 

import java.util.Arrays;
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();
			int arr[] = new int[n];

			for (int i = 0; i < n; i++) {
				arr[i] = sc.nextInt();
			}

			Arrays.sort(arr);

			boolean isPossible = true;

			for (int i = 0; i < n; i++) {
				if (arr[i] != i + 1) {
					isPossible = false;
					break;
				}
			}
			
			if(isPossible) {
				System.out.println("#"+tc+" "+"Yes");
			}
			else {
				System.out.println("#"+tc+" "+"No");
			}
			
		}
	}
}

 

배열을 정렬해준 뒤, 없는 숫자가 있다면 boolean 변수를 false로 바꾸고 빠져나온다(더 볼 필요가 없어서)