[백준]_2529_부등호

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.StringTokenizer;

public class B2529 {
	static int N;
	static char[] arr;
	static List<String> num = new ArrayList<>();
	static boolean[] visit = new boolean[10];

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;

		N = Integer.parseInt(br.readLine());
		arr = new char[N];

		st = new StringTokenizer(br.readLine());
		for (int i = 0; i < N; i++) {
			arr[i] = st.nextToken().charAt(0);
		}

		search(0, new String());
		// 조건 만족한 문자열 정렬
		Collections.sort(num);
		System.out.println(num.get(num.size() - 1) +"\n" + num.get(0));
	}

	private static void search(int cnt, String sb) {
		if (cnt == N + 1) {
			num.add(sb);
			return;
		}
		for (int i = 0; i < 10; i++) {
			// 방문 여부 및 부등호 연산이 맞는지 체크
			if (!visit[i] && (cnt == 0 || check(sb.charAt(cnt - 1) - '0', i, arr[cnt - 1]))) {
				visit[i] = true;
				search(cnt + 1, sb + i);
				visit[i] = false;
			}
		}
	}

	private static boolean check(int prior, int idx, char op) {
		if (op == '<' && prior > idx)
			return false;
		if (op == '>' && prior < idx)
			return false;
		return true;
	}

}