Programmers - Lv.0

• 양꼬치

int solution(int n, int k) {
    int answer = 0;
    
    int service = n/10;
    
    answer = n*12000 + (k - service)*2000;
    
    return answer;
}

 

• 중복된 숫자 개수

class Solution {
    public int solution(int[] array, int n) {
        int answer = 0;
        
        for(int num: array){
            answer += num==n? 1:0;
        }
/*        
        for (int num : array) {
            if (num == n) answer++;
        }
        
        for(int i=0; i<array.length; i++){
            if(array[i] == n){
                answer += 1;
            }
        }
*/        
        return answer;
    }
}

 

• 피자 나눠 먹기(1)

class Solution {
    public int solution(int n) {
        int answer = 0;
        
        answer = n/7;
        
        answer = n%7 > 0 ? answer+1 : answer;
        
        return answer;
    }
}