프로그래머스 양궁대회 (JAVA)

2022 KAKAO BLIND RECRUITMENT > 양궁대회

 

---

 

https://tech.kakao.com/2022/01/14/2022-kakao-recruitment-round-1/

2022 카카오 신입공채 1차 온라인 코딩테스트 for Tech developers 문제해설

 

https://programmers.co.kr/learn/courses/30/lessons/92342

코딩테스트 연습 - 양궁대회

 

 

 static int[] apeach;
    static int N;
    static int max = Integer.MIN_VALUE;
    static List<Result> res = new ArrayList<>();

    public static int[] solution(int n, int[] info) {
        N = n;
        apeach = info;
        shoot(0, 0, new int[11]);
        if (res.isEmpty()) {
            return new int[]{-1};
        }
        Collections.sort(res);
        return res.get(0).target;
    }

    private static void shoot(int cnt, int idx, int[] lion) {
        if (cnt == N) {
            compareScore(lion);
            return;
        }

        for (int i = idx; i < 11; i++) {
            lion[i]++;
            shoot(cnt + 1, i, lion);
            lion[i]--;
        }
    }

    private static void compareScore(int[] lion) {
        int aScore = 0;
        int lScore = 0;
        for (int i = 0; i < apeach.length; i++) {
            if (apeach[i] == 0 && lion[i] == 0) {
                continue;
            }
            if (apeach[i] >= lion[i]) {
                aScore += 10 - i;
            } else {
                lScore += 10 - i;
            }
        }
        if (lScore > aScore) {
            int diff = lScore - aScore;
            if (diff > max) {
                max = diff;
                res.clear();
                res.add(new Result(Arrays.copyOf(lion, 11)));
            } else if (diff == max) {
                res.add(new Result(Arrays.copyOf(lion, 11)));
            }
        }
    }

    static class Result implements Comparable<Result> {

        int[] target;

        public Result(int[] target) {
            this.target = target;
        }

        @Override
        public int compareTo(Result o) {
            for (int i = target.length - 1; i >= 0; i--) {
                if (target[i] != o.target[i]) {
                    return o.target[i] - target[i];
                }
            }
            return 0;
        }
    }