[LintCode] 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.

Have you met this question in a real interview?

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).

LeetCode上的原题，请参见我之前的博客Minimum Size Subarray Sum。

解法一：

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) {int res = INT_MAX, sum = 0, left = 0;for (int i = 0; i < nums.size(); ++i) {sum += nums[i];if (sum >= s) {while (left < i && sum >= s) {res = min(res, i - left + 1);sum -= nums[left++];}}}return res == INT_MAX ? -1 : res;}
};

解法二：

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) {int res = INT_MAX, n = nums.size();vector<int> sums(n + 1, 0);for (int i = 1; i < n + 1; ++i) sums[i] = sums[i - 1] + nums[i - 1];for (int i = 0; i < n + 1; ++i) {int left = i + 1, right = n, t = sums[i] + s;while (left <= right) {int mid = left + (right - left) / 2;if (sums[mid] < t) left = mid + 1;else right = mid - 1;}if (left == n + 1) break;res = min(res, left - i);}return res == INT_MAX ? -1 : res;}
};

[LintCode] Minimum Size Subarray Sum 最小子数组和的大小相关推荐

Minimum Size Subarray Sum 最短子数组之和
题意 Given an array of n positive integers and a positive integer s, find the minimal length of a suba ...
209. Minimum Size Subarray Sum 长度最小的子数组
Title 给定一个含有 n 个正整数的数组和一个正整数 s ,找出该数组中满足其和 ≥ s 的长度最小的连续子数组,并返回其长度.如果不存在符合条件的连续子数组,返回 0. **示例: ** 输入: ...
leetcode 209. Minimum Size Subarray Sum | 209. 长度最小的子数组（Java）
题目 https://leetcode.com/problems/minimum-size-subarray-sum/ 题解双指针解法,左指针和右指针在合适的时候向右走,并维护一个sum 版本1 思 ...
[JAVA]寻找满足和的最短子序列（Minimum Size Subarray Sum）
题目来源:leetcode 题目描述: Given an array of n positive integers and a positive integer s, find the minimal ...
LintCode 402: Continuous Subarray Sum
LintCode 402: Continuous Subarray Sum 题目描述给定一个整数数组,请找出一个连续子数组,使得该子数组的和最大.输出答案时,请分别返回第一个数字和最后一个数字的下标 ...
Leetcode209-Minimum Size Subarray Sum
新的个人博客:Hu Haoyu's Blog,欢迎参观! Given an array of n positive integers and a positive integer s, find th ...
LeetCode 325. Maximum Size Subarray Sum Equals k
这一题开始以为是sliding window,后来发现,因为有负数,sum不具有单调性,没有办法用slidng window找出optimal solution. 如果考虑brute force的做法 ...
LintCode Python 简单级题目 41.最大子数组 - 44.最小子数组和
题目1 最小子数组描述: 给定一个整数数组,找到一个具有最小和的子数组.返回其最小和. 注意事项子数组最少包含一个数字您在真实的面试中是否遇到过这个题? Yes 样例给出数组[1, -1, - ...
领扣LintCode问题答案-44. 最小子数组
领扣LintCode问题答案-44. 最小子数组目录 44. 最小子数组鸣谢 44. 最小子数组给定一个整数数组,找到一个具有最小和的连续子数组.返回其最小和. 子数组最少包含一个数字样例 1 ...

[LintCode] Minimum Size Subarray Sum 最小子数组和的大小

[LintCode] Minimum Size Subarray Sum 最小子数组和的大小相关推荐

最新文章

热门文章