[Leetcode]303. Range Sum Query - Immutable

最新推荐文章于 2024-07-25 14:07:23 发布

UCanMakeIt

最新推荐文章于 2024-07-25 14:07:23 发布

阅读量273

点赞数

分类专栏： leetcode 文章标签： leetcode JAVA

本文链接：https://blog.csdn.net/u010755949/article/details/50875793

版权

leetcode 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

C++的VECTOR还是不太会用，先留个坑以后补

public class NumArray {
    
    int[] data;
    public NumArray(int[] nums) {
        data=nums;
    }

    public int sumRange(int i, int j) {
        int result = 0;
        for(int k=i;k<=j;k++)
        {
            result+=data[k];
        }
        return result;
    }
}


// Your NumArray object will be instantiated and called as such:
// NumArray numArray = new NumArray(nums);
// numArray.sumRange(0, 1);
// numArray.sumRange(1, 2);