[COS PRO 1급 기출문제 - Java] 1-9 계단 게임

edu.goorm.io/learn/lecture/17301/cos-pro-1%EA%B8%89-%EA%B8%B0%EC%B6%9C%EB%AC%B8%EC%A0%9C-java/lesson/839403/1%EC%B0%A8-%EB%AC%B8%EC%A0%9C9-%EA%B3%84%EB%8B%A8-%EA%B2%8C%EC%9E%84-java

goorm

 

문제 유형

코드 수정하기

 

문제

 

class Main {
    public int func(int record){
        if(record == 0) return 1;
        else if(record == 1) return 2;
        return 0;
    }
 
    public int solution(int[] recordA, int[] recordB){
        int cnt = 0;
        for(int i = 0; i < recordA.length; i++){
            if(recordA[i] == recordB[i])
                continue;
            else if(recordA[i] == func(recordB[i]))
                cnt = cnt + 3;
            else 
                cnt = cnt - 1;
        }
        return cnt;
    }
 
public static void main(String[] args) {
        Main sol = new Main();
        int[] recordA = {2,0,0,0,0,0,1,1,0,0};
        int[] recordB = {0,0,0,0,2,2,0,2,2,2};
        int ret = sol.solution(recordA, recordB);
 
        System.out.println("solution 함수의 반환값은 " + ret + " 입니다.");
    }
}

 

풀이

class Main {
    public int func(int record){
        if(record == 0) return 1;
        else if(record == 1) return 2;
        return 0;
    }
 
    public int solution(int[] recordA, int[] recordB){
        int cnt = 0;
            // 0 : 가위, 1 : 바위, 2 : 보
        for(int i = 0; i < recordA.length; i++){
            if(recordA[i] == recordB[i])
                continue;
            else if(recordA[i] == func(recordB[i]))
                cnt = cnt + 3;
            else 
                cnt = Math.max(0, cnt - 1);
        }
        return cnt;
    }
 
public static void main(String[] args) {
        Main sol = new Main();
        int[] recordA = {2,0,0,0,0,0,1,1,0,0};
        int[] recordB = {0,0,0,0,2,2,0,2,2,2};
        int ret = sol.solution(recordA, recordB);
 
        System.out.println("solution 함수의 반환값은 " + ret + " 입니다.");
    }
}