LeetCode209

最新推荐文章于 2023-02-01 19:58:18 发布

那些小花

最新推荐文章于 2023-02-01 19:58:18 发布

阅读量62

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_34769067/article/details/97752995

版权

LeetCode 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

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

Example:

Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the minimal length under the problem constraint.
Follow up:
If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/minimum-size-subarray-sum
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

在这里插入图片描述

class Solution {
    public int minSubArrayLen(int s, int[] nums) {
     	int minLen =Integer.MAX_VALUE;
	    int sum=0;
		for (int i = 0; i < nums.length; i++) {
			int temLen=0;
			int f=0;//标记temLen是否大于等于s
			sum=0;
			for (int j = i; j >= 0; j--) {
				sum+=nums[j];
				temLen++;
				if(sum>=s) {
					f=1;
					break;
				}
			}
			if(f==1&&minLen>temLen) {
				minLen=temLen;
			}
		}
		if(minLen==Integer.MAX_VALUE) {
			return 0;
		}else
			return minLen;
    }
}