Leetcode - Range Sum Query - Immutable

Screenshot from 2016-02-27 21:06:26.png

My code:

public class NumArray {
    private int[] sums;
    private int[] nums;
    public NumArray(int[] nums) {
        this.nums = nums;
        this.sums = new int[nums.length];
        for (int i = 0; i < nums.length; i++)
            sums[i] = nums[i];
        for (int i = 1; i < sums.length; i++)
            sums[i] += sums[i - 1];
    }

    public int sumRange(int i, int j) {
        if (i < 0 || i >= sums.length)
            return 0;
        else if (j < 0 || j >= sums.length)
            return 0;
        return nums[i] + sums[j] - sums[i];
    }
}


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

同一個(gè)思路。
Anyway, Good luck, Richardo!

My code:

public class NumArray {

    public NumArray(int[] nums) {
        
    }

    public int sumRange(int i, int j) {
        
    }
}


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

簡(jiǎn)單題,沒(méi)什么好說(shuō)的。

Anyway, Good luck, Richardo! -- 08/20/2016

最后編輯于
?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請(qǐng)聯(lián)系作者
【社區(qū)內(nèi)容提示】社區(qū)部分內(nèi)容疑似由AI輔助生成,瀏覽時(shí)請(qǐng)結(jié)合常識(shí)與多方信息審慎甄別。
平臺(tái)聲明:文章內(nèi)容(如有圖片或視頻亦包括在內(nèi))由作者上傳并發(fā)布,文章內(nèi)容僅代表作者本人觀點(diǎn),簡(jiǎn)書(shū)系信息發(fā)布平臺(tái),僅提供信息存儲(chǔ)服務(wù)。

相關(guān)閱讀更多精彩內(nèi)容

友情鏈接更多精彩內(nèi)容