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

 

public class Solution {
    /**
     * @param nums: an array of integers
     * @param s: an integer
     * @return: an integer representing the minimum size of subarray
     */
    public int minimumSize(int[] nums, int s) {
        // write your code here
        
        if(nums == null || nums.length == 0)
            return -1;
        
        int fast = 0;
        int slow = 0;
        int sum = 0;
        int result = Integer.MAX_VALUE;
        int size = nums.length;
        
        for(int i = 0; i < size; i++)
            sum += nums[i];
        
        if(sum < s)
            return -1;
        
        sum = 0;
        
        while(fast < size){
            while(fast < size && sum < s){
                sum += nums[fast];
                fast++;
            }
            
            //result = Math.min(result, fast - slow + 1);
            
            while(slow < size && sum >= s){
                sum -= nums[slow];
                slow++;
            }
            
            result = Math.min(result, fast - slow + 1);
        }
        
        return result;
    }
}

 

转载于:https://www.cnblogs.com/goblinengineer/p/5341902.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值