[알고리즘] 수열과 구간 쿼리 1 Java

 

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