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.<p>Hard</p> <p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the length of the shortest non-empty <strong>subarray</strong> of</em> <code>nums</code> <em>with a sum of at least</em> <code>k</code>. If there is no such <strong>subarray</strong> , return <code>-1</code>.</p> <p>A <strong>subarray</strong> is a <strong>contiguous</strong> part of an array.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1], k = 1</p> <p><strong>Output:</strong> 1</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,2], k = 4</p> <p><strong>Output:</strong> -1</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [2,-1,2], k = 3</p> <p><strong>Output:</strong> 3</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <li><code>-10⁵ <= nums[i] <= 10⁵</code></li> <li><code>1 <= k <= 10⁹</code></li> </ul>

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)