Minimum Size Subarray Sum

Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return -1 instead.

Example

Given the array [2,3,1,2,4,3] and s = 7, the subarray [4,3] has the minimal length under the problem constraint.

Challenge 

If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).

Analyse: Two pointers. O(n)

Runtime: 203ms

class Solution {
public:
    /**
     * @param nums: a vector of integers
     * @param s: an integer
     * @return: an integer representing the minimum size of subarray
     */
    int minimumSize(vector<int> &nums, int s) {
        // write your code here
        // mark left, set right as left + 1
        // move right until sum of nums[left...right] >= s
        // update the min length and let left move one position
        // if current sum >= s update min length and keep move left
        // if current sum < s move right one position
        
        if (nums.empty()) return -1;
        int left = 0, right = 1;
        int minSize = INT_MAX, tempSum = nums[left];
        if (tempSum > s) return 1;
        while (left < nums.size() && right < nums.size()) {
            tempSum += nums[right];
            while (tempSum >= s) {
                minSize = min(minSize, right - left + 1);
                tempSum -= nums[left];
                left++;
            }
            if (tempSum < s) {
                right++;
            }
        }
        return minSize == INT_MAX ? -1 : minSize;
    }
};

Analyse: Brute force. O(n^2)

Runtime: 605ms

class Solution {
public:
    /**
     * @param nums: a vector of integers
     * @param s: an integer
     * @return: an integer representing the minimum size of subarray
     */
    int minimumSize(vector<int> &nums, int s) {
        // write your code here
        if (nums.empty()) return -1;
        
        int result = INT_MAX;
        for (int i = 0; i < nums.size(); i++) {
            int tempSum = nums[i];
            if (tempSum >= s) return 1;
            for (int j = i + 1; j < nums.size(); j++) {
                tempSum += nums[j];
                if (tempSum >= s) {
                    result = min(result, j - i + 1);
                    break;
                }
            }
        }
        return result == INT_MAX ? -1 : result;
    }
};