Skip to content

Commit 683eeef

Browse files
yanglbmeyanglbme
authored
feat: update lc problems (doocs#3686)
1 parent be114e6 commit 683eeef

File tree

20 files changed

+98
-34
lines changed

20 files changed

+98
-34
lines changed

‎solution/0700-0799/0729.My Calendar I/README_EN.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -24,13 +24,13 @@ tags:
2424

2525
<p>A <strong>double booking</strong> happens when two events have some non-empty intersection (i.e., some moment is common to both events.).</p>
2626

27-
<p>The event can be represented as a pair of integers <code>start</code> and <code>end</code> that represents a booking on the half-open interval <code>[start, end)</code>, the range of real numbers <code>x</code> such that <code>start &lt;= x &lt; end</code>.</p>
27+
<p>The event can be represented as a pair of integers <code>startTime</code> and <code>endTime</code> that represents a booking on the half-open interval <code>[startTime, endTime)</code>, the range of real numbers <code>x</code> such that <code>startTime &lt;= x &lt; endTime</code>.</p>
2828

2929
<p>Implement the <code>MyCalendar</code> class:</p>
3030

3131
<ul>
3232
<li><code>MyCalendar()</code> Initializes the calendar object.</li>
33-
<li><code>boolean book(int start, int end)</code> Returns <code>true</code> if the event can be added to the calendar successfully without causing a <strong>double booking</strong>. Otherwise, return <code>false</code> and do not add the event to the calendar.</li>
33+
<li><code>boolean book(int startTime, int endTime)</code> Returns <code>true</code> if the event can be added to the calendar successfully without causing a <strong>double booking</strong>. Otherwise, return <code>false</code> and do not add the event to the calendar.</li>
3434
</ul>
3535

3636
<p>&nbsp;</p>

‎solution/0700-0799/0731.My Calendar II/README_EN.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -25,13 +25,13 @@ tags:
2525

2626
<p>A <strong>triple booking</strong> happens when three events have some non-empty intersection (i.e., some moment is common to all the three events.).</p>
2727

28-
<p>The event can be represented as a pair of integers <code>start</code> and <code>end</code> that represents a booking on the half-open interval <code>[start, end)</code>, the range of real numbers <code>x</code> such that <code>start &lt;= x &lt; end</code>.</p>
28+
<p>The event can be represented as a pair of integers <code>startTime</code> and <code>endTime</code> that represents a booking on the half-open interval <code>[startTime, endTime)</code>, the range of real numbers <code>x</code> such that <code>startTime &lt;= x &lt; endTime</code>.</p>
2929

3030
<p>Implement the <code>MyCalendarTwo</code> class:</p>
3131

3232
<ul>
3333
<li><code>MyCalendarTwo()</code> Initializes the calendar object.</li>
34-
<li><code>boolean book(int start, int end)</code> Returns <code>true</code> if the event can be added to the calendar successfully without causing a <strong>triple booking</strong>. Otherwise, return <code>false</code> and do not add the event to the calendar.</li>
34+
<li><code>boolean book(int startTime, int endTime)</code> Returns <code>true</code> if the event can be added to the calendar successfully without causing a <strong>triple booking</strong>. Otherwise, return <code>false</code> and do not add the event to the calendar.</li>
3535
</ul>
3636

3737
<p>&nbsp;</p>

‎solution/3300-3399/3330.Find the Original Typed String I/README.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 简单
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3330.Find%20the%20Original%20Typed%20String%20I/README.md
5+
tags:
6+
- 字符串
57
---
68

79
<!-- problem:start -->

‎solution/3300-3399/3330.Find the Original Typed String I/README_EN.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Easy
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3330.Find%20the%20Original%20Typed%20String%20I/README_EN.md
5+
tags:
6+
- String
57
---
68

79
<!-- problem:start -->

‎solution/3300-3399/3331.Find Subtree Sizes After Changes/README.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3331.Find%20Subtree%20Sizes%20After%20Changes/README.md
5+
tags:
6+
- 树
7+
- 深度优先搜索
8+
- 数组
9+
- 哈希表
10+
- 字符串
511
---
612

713
<!-- problem:start -->

‎solution/3300-3399/3331.Find Subtree Sizes After Changes/README_EN.md

Lines changed: 7 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3331.Find%20Subtree%20Sizes%20After%20Changes/README_EN.md
5+
tags:
6+
- Tree
7+
- Depth-First Search
8+
- Array
9+
- Hash Table
10+
- String
511
---
612

713
<!-- problem:start -->
@@ -26,9 +32,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3331.Fi
2632
<li>Otherwise, <strong>remove</strong> the edge between <code>x</code> and its current parent and make node <code>y</code> the new parent of <code>x</code> by adding an edge between them.</li>
2733
</ul>
2834

29-
<p>Return an array <code>answer</code> of size <code>n</code> where <code>answer[i]</code> is the <strong>size</strong> of the subtree rooted at node <code>i</code> in the <strong>final</strong> tree.</p>
30-
31-
<p>A <strong>subtree</strong> of <code>treeName</code> is a tree consisting of a node in <code>treeName</code> and all of its descendants.</p>
35+
<p>Return an array <code>answer</code> of size <code>n</code> where <code>answer[i]</code> is the <strong>size</strong> of the <span data-keyword="subtree">subtree</span> rooted at node <code>i</code> in the <strong>final</strong> tree.</p>
3236

3337
<p>&nbsp;</p>
3438
<p><strong class="example">Example 1:</strong></p>

‎solution/3300-3399/3332.Maximum Points Tourist Can Earn/README.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3332.Maximum%20Points%20Tourist%20Can%20Earn/README.md
5+
tags:
6+
- 数组
7+
- 动态规划
8+
- 矩阵
59
---
610

711
<!-- problem:start -->

‎solution/3300-3399/3332.Maximum Points Tourist Can Earn/README_EN.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3332.Maximum%20Points%20Tourist%20Can%20Earn/README_EN.md
5+
tags:
6+
- Array
7+
- Dynamic Programming
8+
- Matrix
59
---
610

711
<!-- problem:start -->

‎solution/3300-3399/3333.Find the Original Typed String II/README.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3333.Find%20the%20Original%20Typed%20String%20II/README.md
5+
tags:
6+
- 字符串
7+
- 动态规划
8+
- 前缀和
59
---
610

711
<!-- problem:start -->

‎solution/3300-3399/3333.Find the Original Typed String II/README_EN.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3333.Find%20the%20Original%20Typed%20String%20II/README_EN.md
5+
tags:
6+
- String
7+
- Dynamic Programming
8+
- Prefix Sum
59
---
610

711
<!-- problem:start -->

0 commit comments

Comments
 (0)