[Programmers] Lv.0 / 수열과 구간 쿼리 1 / Java

문제

 

풀이

class Solution {
    public int[] solution(int[] arr, int[][] queries) {
        
        int[] answer = arr;
        int s; int e;
        
        for(int i = 0; i < queries.length; i++) {
            s = queries[i][0];
            e = queries[i][1];
            
            for(int j = 0; j < arr.length; j++) {
                if(s <= j && j <= e) {
                    answer[j] += 1;
                    continue;
                }
            }
        }
        return answer;
    }
}

class Solution {
    public int[] solution(int[] arr, int[][] queries) {
        
        int[] answer = {};

        for(int i = 0; i < queries.length; i++) {
            for(int j = queries[i][0]; j <= queries[i][1]; j++) {
                arr[j]++;
            }
        }
        return arr;
    }
}

class Solution {
    public int[] solution(int[] arr, int[][] queries) {
        for(int[] query : queries) {
            int s = query[0], e = query[1];
            for(int i = s; i <= e; i++) {
                arr[i]++;
            }
        }
        return arr;
    }
}

 

출처

https://school.programmers.co.kr/learn/courses/30/lessons/181883?language=java