딸기버블티

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

class Solution {
    public int[] solution(int n) {
        int length = n % 2 == 0 ? n/2 : n/2 + 1;
        int[] answer = new int[length];
        int index = 0;
        for(int i=0; i<=n; i++){
            if(i % 2 != 0){
                answer[index] = i;
                index++;
            }
        }
        return answer;
    }
}

import java.util.*;
class Solution {
    public int solution(int[] array) {
        int count = 0;
        int answer = 0;
        int maxBindo = 0;
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        for(int num : array){
            int bindo = map.getOrDefault(num, 0) + 1;
            if(bindo > maxBindo){
                maxBindo = bindo;
                answer = num;
            }
            else if(bindo == maxBindo){
                answer = -1;
            }
            map.put(num, bindo);
        }
        return answer;
    }
}

class Solution {
    public int[] solution(int[] numbers) {
        int[] answer = new int[numbers.length];
        for(int i=0; i<numbers.length; i++){
            answer[i] = numbers[i] * 2;
        }
        return answer;
    }
}