Leetcode#862. Shortest Subarray with Sum at Least K
ProblemGiven 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:
123Input: nums = [1], k = 1Output: 1
Example 2:
123Input: nums = [1,2], k = 4Output: -1
Example 3:
123Input: nums = [2,-1,2], k = 3Output: 3
Constraints:
1 <= nums.length <= 10^5
10^5 <= nums[i] <= 10^5
1 <= k <= 10^9
Solve想破頭 簡單說就是 找到第一組解後 ...
Leetcode#933. Number of Recent Calls
ProblemYou have a RecentCounter class which counts the number of recent requests within a certain time frame.
Implement the RecentCounter class:
RecentCounter() Initializes the counter with zero recent requests.
int ping(int t) Adds a new request at time t, where t represents some time in milliseconds, and returns the number of requests that has happened in the past 3000 milliseconds (including the new request). Specifically, return the number of requests that have happened in the inclusive ran ...
Leetcode#950. Reveal Cards In Increasing Order
ProblemYou are given an integer array deck. There is a deck of cards where every card has a unique integer. The integer on the ith card is deck[i].
You can order the deck in any order you want. Initially, all the cards start face down (unrevealed) in one deck.
You will do the following steps repeatedly until all cards are revealed:
Take the top card of the deck, reveal it, and take it out of the deck.
If there are still cards in the deck then put the next top card of the deck at the bottom of t ...