Skip to content

Commit 7c9283e

yanglbme yanglbme

authored

feat: add biweekly contest 146 (doocs#3876)

1 parent 60d86dc commit 7c9283eCopy full SHA for 7c9283e

File tree

51 files changed

+1149

-463

lines changed

solution
- 0300-0399/0357.Count Numbers with Unique Digits
  - README.md
- 0500-0599/0552.Student Attendance Record II
  - README.md
- 0600-0699/0600.Non-negative Integers without Consecutive Ones
  - README.md
  - README_EN.md
- 0700-0799/0788.Rotated Digits
  - README.md
- 0800-0899
  - 0813.Largest Sum of Averages
    - README.md
    - README_EN.md
  - 0877.Stone Game
    - README_EN.md
  - 0887.Super Egg Drop
    - README.md
- 0900-0999/0977.Squares of a Sorted Array
  - README.md
- 1800-1899/1891.Cutting Ribbons
  - README.md
- 1900-1999/1921.Eliminate Maximum Number of Monsters
  - README.md
- 2200-2299/2265.Count Nodes Equal to Average of Subtree
  - README_EN.md
- 2400-2499/2403.Minimum Time to Kill All Monsters
  - README_EN.md
- 3300-3399
  - 3369.Design an Array Statistics Tracker
    - README.md
    - README_EN.md
  - 3376.Minimum Time to Break Locks I
    - README_EN.md
  - 3385.Minimum Time to Break Locks II
    - README.md
    - README_EN.md
  - 3386.Button with Longest Push Time
    - README.md
    - README_EN.md
  - 3387.Maximize Amount After Two Days of Conversions
    - README.md
    - README_EN.md
  - 3388.Count Beautiful Splits in an Array
    - README.md
    - README_EN.md
  - 3389.Minimum Operations to Make Character Frequencies Equal
    - README.md
    - README_EN.md
  - 3390.Longest Team Pass Streak
    - README.md
    - README_EN.md
  - 3391.Design a 3D Binary Matrix with Efficient Layer Tracking
    - README.md
    - README_EN.md
  - 3392.Count Subarrays of Length Three With a Condition
  - 3393.Count Paths With the Given XOR Value
    - README.md
    - README_EN.md
  - 3394.Check if Grid can be Cut into Sections
    - README.md
    - README_EN.md
    - images
      - tc2drawio.png
      - tt1drawio.png
  - 3395.Subsequences with a Unique Middle Mode I
    - README.md
    - README_EN.md
- CONTEST_README.md
- CONTEST_README_EN.md
- README.md
- README_EN.md
- contest.json

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

51 files changed

+1149

-463

lines changed

`‎solution/0300-0399/0357.Count Numbers with Unique Digits/README.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -29,7 +29,7 @@ tags:`
`29`	`29`	`<pre>`
`30`	`30`	`<strong>输入:</strong>n = 2`
`31`	`31`	`<strong>输出:</strong>91`
`32`		`-<strong>解释:</strong>答案应为除去 <code>11、22、33、44、55、66、77、88、99 </code>外,在 0 ≤ x < 100 范围内的所有数字。`
	`32`	`+<strong>解释:</strong>答案应为除去 <code>11、22、33、44、55、66、77、88、99 </code>外,在 0 ≤ x < 100 范围内的所有数字。`
`33`	`33`	`</pre>`
`34`	`34`
`35`	`35`	`<p><strong>示例 2:</strong></p>`

`‎solution/0500-0599/0552.Student Attendance Record II/README.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -42,7 +42,7 @@ tags:`
`42`	`42`	`<strong>输出:</strong>8`
`43`	`43`	`<strong>解释:`
`44`	`44`	`</strong>有 8 种长度为 2 的记录将被视为可奖励:`
`45`		`-"PP" , "AP", "PA", "LP", "PL", "AL", "LA", "LL"`
	`45`	`+"PP" , "AP", "PA", "LP", "PL", "AL", "LA", "LL"`
`46`	`46`	`只有"AA"不会被视为可奖励,因为缺勤次数为 2 次(需要少于 2 次)。`
`47`	`47`	`</pre>`
`48`	`48`

`‎solution/0600-0699/0600.Non-negative Integers without Consecutive Ones/README.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -25,7 +25,7 @@ tags:`
`25`	`25`	`<pre>`
`26`	`26`	`<strong>输入:</strong> n = 5`
`27`	`27`	`<strong>输出:</strong> 5`
`28`		`-<strong>解释:</strong>`
	`28`	`+<strong>解释:</strong>`
`29`	`29`	`下面列出范围在 [0, 5] 的非负整数与其对应的二进制表示:`
`30`	`30`	`0 : 0`
`31`	`31`	`1 : 1`

`‎solution/0600-0699/0600.Non-negative Integers without Consecutive Ones/README_EN.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -32,7 +32,7 @@ Here are the non-negative integers <= 5 with their corresponding binary repre`
`32`	`32`	`3 : 11`
`33`	`33`	`4 : 100`
`34`	`34`	`5 : 101`
`35`		`-Among them, only integer 3 disobeys the rule (two consecutive ones) and the other 5 satisfy the rule.`
	`35`	`+Among them, only integer 3 disobeys the rule (two consecutive ones) and the other 5 satisfy the rule.`
`36`	`36`	`</pre>`
`37`	`37`
`38`	`38`	`<p><strong class="example">Example 2:</strong></p>`

`‎solution/0700-0799/0788.Rotated Digits/README.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -29,7 +29,7 @@ tags:`
`29`	`29`
`30`	`30`	`<pre><strong>输入:</strong> 10`
`31`	`31`	`<strong>输出:</strong> 4`
`32`		`-<strong>解释:</strong>`
	`32`	`+<strong>解释:</strong>`
`33`	`33`	`在[1, 10]中有四个好数: 2, 5, 6, 9。`
`34`	`34`	`注意 1 和 10 不是好数, 因为他们在旋转之后不变。`
`35`	`35`	`</pre>`

`‎solution/0800-0899/0813.Largest Sum of Averages/README.md‎`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -31,9 +31,9 @@ tags:`
`31`	`31`	`<pre>`
`32`	`32`	`<strong>输入:</strong> nums = [9,1,2,3,9], k = 3`
`33`	`33`	`<strong>输出:</strong> 20.00000`
`34`		`-<strong>解释:</strong>`
`35`		`-nums 的最优分组是[9], [1, 2, 3], [9]. 得到的分数是 9 + (1 + 2 + 3) / 3 + 9 = 20.`
`36`		`-我们也可以把 nums 分成[9, 1], [2], [3, 9].`
	`34`	`+<strong>解释:</strong>`
	`35`	`+nums 的最优分组是[9], [1, 2, 3], [9]. 得到的分数是 9 + (1 + 2 + 3) / 3 + 9 = 20.`
	`36`	`+我们也可以把 nums 分成[9, 1], [2], [3, 9].`
`37`	`37`	`这样的分组得到的分数为 5 + 2 + 6 = 13, 但不是最大值.`
`38`	`38`	`</pre>`
`39`	`39`

`‎solution/0800-0899/0813.Largest Sum of Averages/README_EN.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -30,7 +30,7 @@ tags:`
`30`	`30`	`<pre>`
`31`	`31`	`<strong>Input:</strong> nums = [9,1,2,3,9], k = 3`
`32`	`32`	`<strong>Output:</strong> 20.00000`
`33`		`-<strong>Explanation:</strong>`
	`33`	`+<strong>Explanation:</strong>`
`34`	`34`	`The best choice is to partition nums into [9], [1, 2, 3], [9]. The answer is 9 + (1 + 2 + 3) / 3 + 9 = 20.`
`35`	`35`	`We could have also partitioned nums into [9, 1], [2], [3, 9], for example.`
`36`	`36`	`That partition would lead to a score of 5 + 2 + 6 = 13, which is worse.`

`‎solution/0800-0899/0877.Stone Game/README_EN.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -33,7 +33,7 @@ tags:`
`33`	`33`	`<pre>`
`34`	`34`	`<strong>Input:</strong> piles = [5,3,4,5]`
`35`	`35`	`<strong>Output:</strong> true`
`36`		`-<strong>Explanation:</strong>`
	`36`	`+<strong>Explanation:</strong>`
`37`	`37`	`Alice starts first, and can only take the first 5 or the last 5.`
`38`	`38`	`Say she takes the first 5, so that the row becomes [3, 4, 5].`
`39`	`39`	`If Bob takes 3, then the board is [4, 5], and Alice takes 5 to win with 10 points.`

`‎solution/0800-0899/0887.Super Egg Drop/README.md‎`

Lines changed: 5 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -25,17 +25,18 @@ tags:`
`25`	`25`	`<p>每次操作,你可以取一枚没有碎的鸡蛋并把它从任一楼层 <code>x</code> 扔下(满足 <code>1 <= x <= n</code>)。如果鸡蛋碎了,你就不能再次使用它。如果某枚鸡蛋扔下后没有摔碎,则可以在之后的操作中 <strong>重复使用</strong> 这枚鸡蛋。</p>`
`26`	`26`
`27`	`27`	`<p>请你计算并返回要确定 <code>f</code> <strong>确切的值</strong> 的 <strong>最小操作次数</strong> 是多少?</p>`
	`28`	`+`
`28`	`29`
`29`	`30`	`<p><strong>示例 1:</strong></p>`
`30`	`31`
`31`	`32`	`<pre>`
`32`	`33`	`<strong>输入:</strong>k = 1, n = 2`
`33`	`34`	`<strong>输出:</strong>2`
`34`	`35`	`<strong>解释:</strong>`
`35`		`-鸡蛋从 1 楼掉落。如果它碎了,肯定能得出 f = 0 。`
`36`		`-否则,鸡蛋从 2 楼掉落。如果它碎了,肯定能得出 f = 1 。`
`37`		`-如果它没碎,那么肯定能得出 f = 2 。`
`38`		`-因此,在最坏的情况下我们需要移动 2 次以确定 f 是多少。`
	`36`	`+鸡蛋从 1 楼掉落。如果它碎了,肯定能得出 f = 0 。`
	`37`	`+否则,鸡蛋从 2 楼掉落。如果它碎了,肯定能得出 f = 1 。`
	`38`	`+如果它没碎,那么肯定能得出 f = 2 。`
	`39`	`+因此,在最坏的情况下我们需要移动 2 次以确定 f 是多少。`
`39`	`40`	`</pre>`
`40`	`41`
`41`	`42`	`<p><strong>示例 2:</strong></p>`

`‎solution/0900-0999/0977.Squares of a Sorted Array/README.md‎`

Lines changed: 6 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -23,7 +23,7 @@ tags:`
`23`	`23`	`<ul>`
`24`	`24`	`</ul>`
`25`	`25`
`26`		`-<p></p>`
	`26`	`+<p> </p>`
`27`	`27`
`28`	`28`	`<p><strong>示例 1:</strong></p>`
`29`	`29`
`@@ -40,22 +40,22 @@ tags:`
`40`	`40`	`<strong>输出:</strong>[4,9,9,49,121]`
`41`	`41`	`</pre>`
`42`	`42`
`43`		`-<p></p>`
	`43`	`+<p> </p>`
`44`	`44`
`45`	`45`	`<p><strong>提示:</strong></p>`
`46`	`46`
`47`	`47`	`<ul>`
`48`		`- <li><code><span>1 <= nums.length <= </span>10<sup>4</sup></code></li>`
`49`		`- <li><code>-10<sup>4</sup> <= nums[i] <= 10<sup>4</sup></code></li>`
	`48`	`+ <li><code><span>1 <= nums.length <= </span>10<sup>4</sup></code></li>`
	`49`	`+ <li><code>-10<sup>4</sup> <= nums[i] <= 10<sup>4</sup></code></li>`
`50`	`50`	`<li><code>nums</code> 已按 <strong>非递减顺序</strong> 排序</li>`
`51`	`51`	`</ul>`
`52`	`52`
`53`		`-<p></p>`
	`53`	`+<p> </p>`
`54`	`54`
`55`	`55`	`<p><strong>进阶:</strong></p>`
`56`	`56`
`57`	`57`	`<ul>`
`58`		- <li>请你<span style="color: rgb(36, 41, 46); font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", Helvetica, Arial, sans-serif, "Apple Color Emoji", "Segoe UI Emoji"; font-size: 14px; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: start; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; background-color: rgb(255, 255, 255); text-decoration-style: initial; text-decoration-color: initial; display: inline !important; float: none;">设计时间复杂度为 <code>O(n)</code> 的算法解决本问题</span></li>
	`58`	`+ <li>请你设计时间复杂度为 <code>O(n)</code> 的算法解决本问题</li>`
`59`	`59`	`</ul>`
`60`	`60`
`61`	`61`	`<!-- description:end -->`

0 commit comments

Comments

(0)