Package g0801_0900.s0862_shortest_subarray_with_sum_at_least_k

Class Solution

java.lang.Object

g0801_0900.s0862_shortest_subarray_with_sum_at_least_k.Solution

public class Solution
extends Object

862 - Shortest Subarray with Sum at Least K\. Hard Given an integer array `nums` and an integer `k`, return _the length of the shortest non-empty **subarray** of_ `nums` _with a sum of at least_ `k`. If there is no such **subarray** , return `-1`. A **subarray** is a **contiguous** part of an array. **Example 1:** **Input:** nums = [1], k = 1 **Output:** 1 **Example 2:** **Input:** nums = [1,2], k = 4 **Output:** -1 **Example 3:** **Input:** nums = [2,-1,2], k = 3 **Output:** 3 **Constraints:** * 1 <= nums.length <= 105 * -105 <= nums[i] <= 105 * 1 <= k <= 109

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	shortestSubarray(int[] nums, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

shortestSubarray

public int shortestSubarray(int[] nums,
 int k)