99클럽 코테 스터디 37일차 TIL + 오늘의 학습 키워드

☑️ 문제:  부등호

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

 

☑️ Code

import java.util.*;

public class Main {
    static int N;
    static char[] operators;
    static boolean[] used = new boolean[10];
    static ArrayList<Long> results = new ArrayList<>();

    public static void main(String args[]) {
        input();
        backtracking(0, 0);
        
        Collections.sort(results);
        System.out.println(results.get(results.size() - 1));
        System.out.println(results.get(0));
    }
    
    static void backtracking(int depth, long num) {
        if (depth == N + 1) {
            results.add(num);
            return;
        }
        
        for (int i = 0; i <= 9; i++) {
            if (!used[i]) {
                used[i] = true;
                backtracking(depth + 1, num * 10 + i);
                used[i] = false;
            }
        }
    }
    
    static boolean check(char a, char b, char op) {
        if (op == '<') {
            return a < b;
        }
        if (op == '>') {
            return a > b;
        }
        return false;
    }
    
    static void input() {
        Scanner sc = new Scanner(System.in);
        N = sc.nextInt();
        operators = new char[N];
        for (int i = 0; i < N; i++) {
            operators[i] = sc.next().charAt(0);
        }        
    }
}