coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/problem (Chinese)/和为 k 的子数组 [QTMn0o].html
View File

@@ -2,7 +2,7 @@
<p>&nbsp;</p>
<p><strong>示例 1 :</strong></p>
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入:</strong>nums = [1,1,1], k = 2
@@ -10,7 +10,7 @@
<strong>解释:</strong> 此题 [1,1] 与 [1,1] 为两种不同的情况
</pre>
<p><strong>示例 2&nbsp;:</strong></p>
<p><strong>示例 2：</strong></p>
<pre>
<strong>输入:</strong>nums = [1,2,3], k = 3