Leetcode_DP_303_RangeSumQuery(Immutable)

Description

Thinking

• Violent Solution
  • Creating a two-dimensional array dp where dp[i][j] denotes the sum of the elements between indices i and j.
• Dynamic Programming Solution
  • Creating a one-dimensional array dp where dp[i] denotes the sum of the elements between indices 0 and i.
  • State: dp[i], dp[0] = nums[0]
  • Transformation equation: dp[i] = nums[i] + dp[i-1];

Code

Violent Solution

class NumArray {
public:
    NumArray(vector<int>& nums) {
        // initialization
        dp = new int*[nums.size()];
        for (int i=0; i<nums.size(); i++) {
            dp[i] = new int[nums.size()]();
        }
        
        for (int i=0; i<nums.size(); i++) {
            for (int j=i; j<nums.size(); j++) {
                if (i == j) {
                    dp[i][j] = nums[i];
                } else {
                    dp[i][j] = dp[i][j-1] + nums[j];   
                }
            }
        }
    }
    
    int sumRange(int i, int j) {
        return dp[i][j];
    }
    
private:
    int** dp;
};

/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray* obj = new NumArray(nums);
 * int param_1 = obj->sumRange(i,j);
 */

Dynamic Programming Solution

class NumArray {
public:
    NumArray(vector<int>& nums) {
        if (nums.size() != 0) {
            dp = new int[nums.size()]();
            dp[0] = nums[0];

            for (int i=1; i<nums.size(); i++) {
                dp[i] = nums[i] + dp[i-1];
            }   
        }
    }
    
    int sumRange(int i, int j) {
        
        if (i == 0)
            return dp[j];
        return dp[j]-dp[i-1];
    }
    
private:
    int* dp;
};

/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray* obj = new NumArray(nums);
 * int param_1 = obj->sumRange(i,j);
 */