Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 0dc15ee

Browse files
committed
Update 0862. 和至少为 K 的最短子数组.md
1 parent 8a8154b commit 0dc15ee

File tree

1 file changed

+6
-0
lines changed

1 file changed

+6
-0
lines changed

‎Solutions/0862. 和至少为 K 的最短子数组.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -99,3 +99,9 @@ class Solution:
9999
- **时间复杂度**:$O(n),ドル其中 $n$ 为数组 $nums$ 的长度。
100100
- **空间复杂度**:$O(n)$。
101101

102+
## 参考资料
103+
104+
- 【题解】[862. 和至少为 K 的最短子数组 - 力扣](https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k/solutions/1925036/liang-zhang-tu-miao-dong-dan-diao-dui-li-9fvh/)
105+
- 【题解】[Leetcode 862:和至少为 K 的最短子数组 - 掘金](https://juejin.cn/post/7076316608460750856)
106+
- 【题解】[LeetCode 862. 和至少为 K 的最短子数组 - AcWing](https://www.acwing.com/solution/leetcode/content/612/)
107+
- 【题解】[0862. Shortest Subarray With Sum at Least K | LeetCode Cookbook](https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K/)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /