Package g0801_0900.s0862_shortest_subarray_with_sum_at_least_k

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • <code>-10<sup>5</sup><= numsi<= 10<sup>5</sup></code>

    • <code>1 <= k <= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer shortestSubarray(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

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