LintCode 404. Subarray Sum II (DP和同向双指针经典题)

404. Subarray Sum II

Given an integer array, find a subarray where the sum of numbers is in a given interval. Your code should return the number of possible answers. (The element in the array should be positive)

Example
Given [1,2,3,4] and interval = [1,3], return 4. The possible answers are:

[0, 0]
[0, 1]
[1, 1]
[2, 2]

解法1：
DP, 2重数组, 空间太大通不过。
代码如下：

class Solution {
public:
    /**
     * @param A: An integer array
     * @param start: An integer
     * @param end: An integer
     * @return: the number of possible answer
     */
    int subarraySumII(vector<int> &A, int start, int end) {
        int n = A.size();
        if (n == 0) return 0;
        
        int begin = 0, last = 0;
        int count = 0;
        vector<vector<int>> sums(n + 1, vector<int>(n + 1, 0));

        for (int i = 1; i <= n; ++i) {
            sums[1][i] = sums[1][i - 1] + A[i - 1];
            if (sums[1][i] >= start && sums[1][i] <= end) count++;
        }

        for (int i = 2; i <= n; ++i) {        
            sums[i][i] = A[i - 1];
            if (sums[i][i] >= start && sums[i][i] <= end) count++;
        }

        for (int i = 2; i <= n; ++i) {
            for (int j = i + 1; j <= n; ++j) {
               if (sums[i][j] == 0) {
                    sums[i][j] = sums[i][j - 1] + A[j - 1];
                    if (sums[i][j] >= start && sums[i][j] <= end) {
                        count++;
                    }
                }
            }    
        }
        
        return count;
    }
};

解法2：DP， 1维数组。
代码如下：

class Solution {
public:
    /**
     * @param A: An integer array
     * @param start: An integer
     * @param end: An integer
     * @return: the number of possible answer
     */
    int subarraySumII(vector<int> &A, int start, int end) {
        int n = A.size();
        if (n == 0) return 0;
        
        int begin = 0, last = 0;
        int count = 0;
        vector<int> sums(n + 1, 0);

        for (int i = 1; i <= n; ++i) {
            sums[1] = sums[1] + A[i - 1];
            if (sums[1] >= start && sums[1] <= end) count++;
        }

        for (int i = 2; i <= n; ++i) {        
            sums[i] = A[i - 1];
            if (sums[i] >= start && sums[i] <= end) count++;
        }

        for (int i = 2; i <= n; ++i) {
            for (int j = i + 1; j <= n; ++j) {
                sums[i] += A[j - 1];
                if (sums[i] >= start && sums[i] <= end) {
                    count++;
                }
            }    
        }
        
        return count;
    }
};

解法3：
presums[] + 同向双指针，分别求大于start-1和end的subarray个数，然后相减。时间复杂度O(n)。

代码如下：

class Solution {
public:
    /**
     * @param A: An integer array
     * @param start: An integer
     * @param end: An integer
     * @return: the number of possible answer
     */
    int subarraySumII(vector<int> &A, int start, int end) {
        int n = A.size();
        if (n == 0) return 0;
        if (end == 0) return 0;
        
        int p1 = 0, p2 = 1;
        int count = 0;
        vector<int> sums(n + 1, 0);
        for (int i = 1; i <= n; ++i) {
            sums[i] += sums[i - 1] + A[i - 1];
        }
        return largerSubarraySum(sums, start - 1) - largerSubarraySum(sums, end);

        return count;
    }

private:
    int largerSubarraySum(vector<int> &A, int target) {
        int n = A.size() - 1;  //注意这里要-1
        int p1 = 0, p2 = 1;
        int count = 0;
        while (p2 <= n && p1 <= p2) {
            if (A[p2] - A[p1] <= target) {
                p2++;
            } else {
                count += n - p2 + 1;   //重要！
                p1++;
            }
        }
        
        return count;
    }
};

解法4：二分查找。复杂度O(nlogn)。下次写。