์•Œ๊ณ ๋ฆฌ์ฆ˜๐Ÿˆ

๋ฌธ์ œํ’€์ด - ๋‹คํŠธ ๊ฒŒ์ž„, ๋กœ๋˜์˜ ์ตœ๊ณ ์ˆœ์œ„์™€ ์ตœ์ €์ˆœ์œ„

Jeein0313 2023. 8. 20. 22:02

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ๋‹คํŠธ ๊ฒŒ์ž„

class Solution {
    public int solution(String dartResult) {
        int answer=0;
        int[] dart = new int[3];

        int n=0;
        int idx=0;
        String numStr = "";

        for(int i=0;i<dartResult.length();i++){
            char c = dartResult.charAt(i);

            //์ˆซ์ž์ผ ๊ฒฝ์šฐ
            if(c >='0' && c<='9'){
                numStr += String.valueOf(c);
            }
            //๋ณด๋„ˆ์Šค์ผ ๊ฒฝ์šฐ
            else if(c=='S' || c=='D' || c=='T'){
                n = Integer.parseInt(numStr);
                if(c=='S'){
                    dart[idx++] = (int)Math.pow(n, 1);
                }
                else if(c=='D'){
                    dart[idx++] = (int)Math.pow(n, 2);
                }
                else{
                    dart[idx++] = (int)Math.pow(n, 3);
                }
                numStr = "";
            }
            //์˜ต์…˜์ผ ๋•Œ
            else{
                if(c=='*'){
                    dart[idx-1]*=2;
                    if(idx-2>=0) dart[idx-2]*=2;
                }else{
                    dart[idx - 1] *= (-1);
                }
            }

        }
        answer=dart[0]+dart[1]+dart[2];

        return answer;
    }
}

 

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ๋กœ๋˜์˜ ์ตœ๊ณ ์ˆœ์œ„์™€ ์ตœ์ € ์ˆœ์œ„

public int[] solution(int[] lottos, int[] win_nums) {
        int[] answer = new int[2];
        
        int cnt=0;
        int cntZero=0;
        
        for(int i=0;i<lottos.length;i++){
            for(int j=0;j<win_nums.length;j++){
                if(lottos[i]==0){
                    cntZero++;
                    break;
                }
                else if(lottos[i]==win_nums[j]){
                    cnt++;
                    break;
                }
            }
        }
        
        int max=cnt+cntZero;
        int min=cnt;
        
        if(cnt==0 && cntZero==0) answer[0]=6;
        else answer[0]=7-(cnt+cntZero);
        
        if(cnt<=1) answer[1]=6;
        else answer[1]=7-(cnt);
        
        
        return answer;
 }