HackerRank Java1D数组(第2部分)

public class Solution {
    public static int[] performQueries(int[] a, int[][] queries) {
        int[] result = new int[queries.length];
        
        for (int i = 0; i < queries.length; i++) {
            int[] query = queries[i];
            
            if (query[0] == 0) {
                // 更新操作
                int index = query[1];
                int newValue = query[2];
                a[index] = newValue;
            } else if (query[0] == 1) {
                // 查询操作
                int leftIndex = query[1];
                int rightIndex = query[2];
                int sum = 0;
                for (int j = leftIndex; j <= rightIndex; j++) {
                    sum += a[j];
                }
                result[i] = sum;
            }
        }
        
        return result;
    }
}