Commit 651e3ea

authored

feat: update lc problems (doocs#3646)

1 parent b23860a commit 651e3eaCopy full SHA for 651e3ea

File tree

9 files changed

+19

-16

lines changed

solution
- 0000-0099/0066.Plus One
  - README.md
- 0400-0499
  - 0442.Find All Duplicates in an Array
    - README.md
  - 0480.Sliding Window Median
    - README_EN.md
- 1200-1299/1233.Remove Sub-Folders from the Filesystem
  - README.md
  - README_EN.md
- 2100-2199/2102.Sequentially Ordinal Rank Tracker
  - README.md
- 3000-3099/3095.Shortest Subarray With OR at Least K I
  - README.md
- 3300-3399
  - 3319.K-th Largest Perfect Subtree Size in Binary Tree
    - README.md
  - 3323.Minimize Connected Groups by Inserting Interval
    - README.md

9 files changed

+19

-16

lines changed

`‎solution/0000-0099/0066.Plus One/README.md‎`

Lines changed: 11 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -23,17 +23,17 @@ tags:`
`23`	`23`
`24`	`24`	`<p>你可以假设除了整数 0 之外,这个整数不会以零开头。</p>`
`25`	`25`
`26`		`-<p></p>`
	`26`	`+<p> </p>`
`27`	`27`
`28`		`-<p><strong>示例1:</strong></p>`
	`28`	`+<p><strong>示例 1:</strong></p>`
`29`	`29`
`30`	`30`	`<pre>`
`31`	`31`	`<strong>输入:</strong>digits = [1,2,3]`
`32`	`32`	`<strong>输出:</strong>[1,2,4]`
`33`	`33`	`<strong>解释:</strong>输入数组表示数字 123。`
`34`	`34`	`</pre>`
`35`	`35`
`36`		`-<p><strong>示例2:</strong></p>`
	`36`	`+<p><strong>示例 2:</strong></p>`
`37`	`37`
`38`	`38`	`<pre>`
`39`	`39`	`<strong>输入:</strong>digits = [4,3,2,1]`
`@@ -44,17 +44,20 @@ tags:`
`44`	`44`	`<p><strong>示例 3:</strong></p>`
`45`	`45`
`46`	`46`	`<pre>`
`47`		`-<strong>输入:</strong>digits = [0]`
`48`		`-<strong>输出:</strong>[1]`
	`47`	`+<strong>输入:</strong>digits = [9]`
	`48`	`+<strong>输出:</strong>[1,0]`
	`49`	`+<strong>解释:</strong>输入数组表示数字 9。`
	`50`	`+加 1 得到了 9 + 1 = 10。`
	`51`	`+因此,结果应该是 [1,0]。`
`49`	`52`	`</pre>`
`50`	`53`
`51`		`-<p></p>`
	`54`	`+<p> </p>`
`52`	`55`
`53`	`56`	`<p><strong>提示:</strong></p>`
`54`	`57`
`55`	`58`	`<ul>`
`56`		`- <li><code>1 <= digits.length <= 100</code></li>`
`57`		`- <li><code>0 <= digits[i] <= 9</code></li>`
	`59`	`+ <li><code>1 <= digits.length <= 100</code></li>`
	`60`	`+ <li><code>0 <= digits[i] <= 9</code></li>`
`58`	`61`	`</ul>`
`59`	`62`
`60`	`63`	`<!-- description:end -->`

`‎solution/0400-0499/0442.Find All Duplicates in an Array/README.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -17,7 +17,7 @@ tags:`
`17`	`17`
`18`	`18`	`<!-- description:start -->`
`19`	`19`
`20`		`-<p>给你一个长度为 <code>n</code> 的整数数组 <code>nums</code> ,其中 <code>nums</code> 的所有整数都在范围 <code>[1, n]</code> 内,且每个整数出现 <strong>一次</strong> 或 <strong>两次</strong> 。请你找出所有出现 <strong>两次</strong> 的整数,并以数组形式返回。</p>`
	`20`	`+<p>给你一个长度为 <code>n</code> 的整数数组 <code>nums</code> ,其中 <code>nums</code> 的所有整数都在范围 <code>[1, n]</code> 内,且每个整数出现 <strong>最多</strong><strong>两次</strong> 。请你找出所有出现 <strong>两次</strong> 的整数,并以数组形式返回。</p>`
`21`	`21`
`22`	`22`	`<p>你必须设计并实现一个时间复杂度为 <code>O(n)</code> 且仅使用常量额外空间(不包括存储输出所需的空间)的算法解决此问题。</p>`
`23`	`23`

`‎solution/0400-0499/0480.Sliding Window Median/README_EN.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -36,7 +36,7 @@ tags:`
`36`	`36`	`<pre>`
`37`	`37`	`<strong>Input:</strong> nums = [1,3,-1,-3,5,3,6,7], k = 3`
`38`	`38`	`<strong>Output:</strong> [1.00000,-1.00000,-1.00000,3.00000,5.00000,6.00000]`
`39`		`-<strong>Explanation:</strong>`
	`39`	`+<strong>Explanation:</strong>`
`40`	`40`	`Window position Median`
`41`	`41`	`--------------- -----`
`42`	`42`	`[<strong>1 3 -1</strong>] -3 5 3 6 7 1`

`‎solution/1200-1299/1233.Remove Sub-Folders from the Filesystem/README.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -23,7 +23,7 @@ tags:`
`23`	`23`
`24`	`24`	`<p>你是一位系统管理员,手里有一份文件夹列表 <code>folder</code>,你的任务是要删除该列表中的所有 <strong>子文件夹</strong>,并以 <strong>任意顺序</strong> 返回剩下的文件夹。</p>`
`25`	`25`
`26`		`-<p>如果文件夹 <code>folder[i]</code> 位于另一个文件夹 <code>folder[j]</code> 下,那么 <code>folder[i]</code> 就是 <code>folder[j]</code> 的 <strong>子文件夹</strong> 。</p>`
	`26`	+<p>如果文件夹 <code>folder[i]</code> 位于另一个文件夹 <code>folder[j]</code> 下,那么 <code>folder[i]</code> 就是 <code>folder[j]</code> 的 <strong>子文件夹</strong> 。<code>folder[j]</code> 的子文件夹必须以 <code>folder[j]</code> 开头,后跟一个 <code>"/"</code>。例如,<code>"/a/b"</code> 是 <code>"/a"</code> 的一个子文件夹,但 <code>"/b"</code> 不是 <code>"/a/b/c"</code> 的一个子文件夹。</p>
`27`	`27`
`28`	`28`	`<p>文件夹的「路径」是由一个或多个按以下格式串联形成的字符串:<font color="#c7254e"><font face="Menlo, Monaco, Consolas, Courier New, monospace"><span style="font-size:12.6px"><span style="background-color:#f9f2f4">'/'</span></span></font></font> 后跟一个或者多个小写英文字母。</p>`
`29`	`29`

`‎solution/1200-1299/1233.Remove Sub-Folders from the Filesystem/README_EN.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -23,7 +23,7 @@ tags:`
`23`	`23`
`24`	`24`	`<p>Given a list of folders <code>folder</code>, return <em>the folders after removing all <strong>sub-folders</strong> in those folders</em>. You may return the answer in <strong>any order</strong>.</p>`
`25`	`25`
`26`		`-<p>If a <code>folder[i]</code> is located within another <code>folder[j]</code>, it is called a <strong>sub-folder</strong> of it.</p>`
	`26`	`+<p>If a <code>folder[i]</code> is located within another <code>folder[j]</code>, it is called a <strong>sub-folder</strong> of it. A sub-folder of <code>folder[j]</code> must start with <code>folder[j]</code>, followed by a <code>"/"</code>. For example, <code>"/a/b"</code> is a sub-folder of <code>"/a"</code>, but <code>"/b"</code> is not a sub-folder of <code>"/a/b/c"</code>.</p>`
`27`	`27`
`28`	`28`	`<p>The format of a path is one or more concatenated strings of the form: <code>'/'</code> followed by one or more lowercase English letters.</p>`
`29`	`29`

`‎solution/2100-2199/2102.Sequentially Ordinal Rank Tracker/README.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -59,7 +59,7 @@ tags:`
`59`	`59`	`SORTracker tracker = new SORTracker(); // 初始化系统`
`60`	`60`	`tracker.add("bradford", 2); // 添加 name="bradford" 且 score=2 的景点。`
`61`	`61`	`tracker.add("branford", 3); // 添加 name="branford" 且 score=3 的景点。`
`62`		`-tracker.get(); // 从好带坏的景点为:branford ,bradford 。`
	`62`	`+tracker.get(); // 从好到坏的景点为:branford ,bradford 。`
`63`	`63`	`// 注意到 branford 比 bradford 好,因为它的 <strong>评分更高</strong> (3 > 2) 。`
`64`	`64`	`// 这是第 1 次调用 get() ,所以返回最好的景点:"branford" 。`
`65`	`65`	`tracker.add("alps", 2); // 添加 name="alps" 且 score=2 的景点。`

`‎solution/3000-3099/3095.Shortest Subarray With OR at Least K I/README.md‎`

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -38,6 +38,8 @@ tags:`
`38`	`38`	`<p><strong>解释:</strong></p>`
`39`	`39`
`40`	`40`	`<p>子数组 <code>[3]</code> 的按位 <code>OR</code> 值为 <code>3</code> ,所以我们返回 <code>1</code> 。</p>`
	`41`	`+`
	`42`	`+<p>注意,<code>[2]</code> 也是一个特别子数组。</p>`
`41`	`43`	`</div>`
`42`	`44`
`43`	`45`	`<p><strong class="example">示例 2:</strong></p>`

`‎solution/3300-3399/3319.K-th Largest Perfect Subtree Size in Binary Tree/README.md‎`

Lines changed: 0 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -25,8 +25,6 @@ tags:`
`25`	`25`
`26`	`26`	`<p><strong>完美二叉树 </strong>是指所有叶子节点都在同一层级的树,且每个父节点恰有两个子节点。</p>`
`27`	`27`
`28`		`-<p><strong>子树 </strong>是指树中的某一个节点及其所有后代形成的树。</p>`
`29`		`-`
`30`	`28`	`<p> </p>`
`31`	`29`
`32`	`30`	`<p><strong class="example">示例 1:</strong></p>`

`‎solution/3300-3399/3323.Minimize Connected Groups by Inserting Interval/README.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -30,7 +30,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3323.Mi`
`30`	`30`	`<li>然而,区间组 <code>[[1, 2], [3, 4]]</code> 不是连通的,因为 <code>(2, 3)</code> 段没有被覆盖。</li>`
`31`	`31`	`</ul>`
`32`	`32`
`33`		`-<p>返回在添加 <strong>恰好一个</strong> 新区间到数组后连通组的 <strong>最小</strong> 数量。</p>`
	`33`	`+<p>返回在数组添加 <strong>恰好一个</strong> 新区间后,连通组的 <strong>最小</strong>数量。</p>`
`34`	`34`
`35`	`35`	`<p> </p>`
`36`	`36`

0 commit comments

Comments

(0)

Navigation Menu

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

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 651e3ea

File tree

9 files changed

9 files changed

`‎solution/0000-0099/0066.Plus One/README.md‎`

`‎solution/0400-0499/0442.Find All Duplicates in an Array/README.md‎`

`‎solution/0400-0499/0480.Sliding Window Median/README_EN.md‎`

`‎solution/1200-1299/1233.Remove Sub-Folders from the Filesystem/README.md‎`

`‎solution/1200-1299/1233.Remove Sub-Folders from the Filesystem/README_EN.md‎`

`‎solution/2100-2199/2102.Sequentially Ordinal Rank Tracker/README.md‎`

`‎solution/3000-3099/3095.Shortest Subarray With OR at Least K I/README.md‎`

`‎solution/3300-3399/3319.K-th Largest Perfect Subtree Size in Binary Tree/README.md‎`

`‎solution/3300-3399/3323.Minimize Connected Groups by Inserting Interval/README.md‎`

0 commit comments