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 6aad117

Browse files
feat: add biweekly contest 124 (doocs#2348)
1 parent c8f62df commit 6aad117

File tree

35 files changed

+1028
-195
lines changed

35 files changed

+1028
-195
lines changed

‎.github/workflows/deploy.yml‎

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -54,18 +54,18 @@ jobs:
5454
github_token: ${{ secrets.GITHUB_TOKEN }}
5555
publish_dir: ./site
5656

57-
- name: Sync to gitee.com
58-
uses: wearerequired/git-mirror-action@master
59-
env:
60-
SSH_PRIVATE_KEY: ${{ secrets.RSA_PRIVATE_KEY }}
61-
with:
62-
source-repo: git@github.com:doocs/leetcode.git
63-
destination-repo: git@gitee.com:Doocs/leetcode.git
57+
#- name: Sync to gitee.com
58+
# uses: wearerequired/git-mirror-action@master
59+
# env:
60+
# SSH_PRIVATE_KEY: ${{ secrets.RSA_PRIVATE_KEY }}
61+
# with:
62+
# source-repo: git@github.com:doocs/leetcode.git
63+
# destination-repo: git@gitee.com:Doocs/leetcode.git
6464

65-
- name: Build Gitee Pages
66-
uses: yanglbme/gitee-pages-action@main
67-
with:
68-
gitee-username: yanglbme
69-
gitee-password: ${{ secrets.GITEE_PASSWORD }}
70-
gitee-repo: doocs/leetcode
71-
branch: gh-pages
65+
#- name: Build Gitee Pages
66+
# uses: yanglbme/gitee-pages-action@main
67+
# with:
68+
# gitee-username: yanglbme
69+
# gitee-password: ${{ secrets.GITEE_PASSWORD }}
70+
# gitee-repo: doocs/leetcode
71+
# branch: gh-pages

‎solution/0300-0399/0333.Largest BST Subtree/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# [333. 最大 BST 子树](https://leetcode.cn/problems/largest-bst-subtree)
1+
# [333. 最大二叉搜索子树](https://leetcode.cn/problems/largest-bst-subtree)
22

33
[English Version](/solution/0300-0399/0333.Largest%20BST%20Subtree/README_EN.md)
44

‎solution/0300-0399/0373.Find K Pairs with Smallest Sums/README_EN.md‎

Lines changed: 0 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -27,14 +27,6 @@
2727
<strong>Explanation:</strong> The first 2 pairs are returned from the sequence: [1,1],[1,1],[1,2],[2,1],[1,2],[2,2],[1,3],[1,3],[2,3]
2828
</pre>
2929

30-
<p><strong class="example">Example 3:</strong></p>
31-
32-
<pre>
33-
<strong>Input:</strong> nums1 = [1,2], nums2 = [3], k = 3
34-
<strong>Output:</strong> [[1,3],[2,3]]
35-
<strong>Explanation:</strong> All possible pairs are returned from the sequence: [1,3],[2,3]
36-
</pre>
37-
3830
<p>&nbsp;</p>
3931
<p><strong>Constraints:</strong></p>
4032

‎solution/0600-0699/0629.K Inverse Pairs Array/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66

77
<p>For an integer array <code>nums</code>, an <strong>inverse pair</strong> is a pair of integers <code>[i, j]</code> where <code>0 &lt;= i &lt; j &lt; nums.length</code> and <code>nums[i] &gt; nums[j]</code>.</p>
88

9-
<p>Given two integers n and k, return the number of different arrays consist of numbers from <code>1</code> to <code>n</code> such that there are exactly <code>k</code> <strong>inverse pairs</strong>. Since the answer can be huge, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
9+
<p>Given two integers n and k, return the number of different arrays consisting of numbers from <code>1</code> to <code>n</code> such that there are exactly <code>k</code> <strong>inverse pairs</strong>. Since the answer can be huge, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
1010

1111
<p>&nbsp;</p>
1212
<p><strong class="example">Example 1:</strong></p>

‎solution/0900-0999/0935.Knight Dialer/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
## Description
66

7-
<p>The chess knight has a <strong>unique movement</strong>,&nbsp;it may move two squares vertically and one square horizontally, or two squares horizontally and one square vertically (with both forming the shape of an <strong>L</strong>). The possible movements of chess knight are shown in this diagaram:</p>
7+
<p>The chess knight has a <strong>unique movement</strong>,&nbsp;it may move two squares vertically and one square horizontally, or two squares horizontally and one square vertically (with both forming the shape of an <strong>L</strong>). The possible movements of chess knight are shown in this diagram:</p>
88

99
<p>A chess knight can move as indicated in the chess diagram below:</p>
1010
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0900-0999/0935.Knight%20Dialer/images/chess.jpg" style="width: 402px; height: 402px;" />

‎solution/1000-1099/1071.Greatest Common Divisor of Strings/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
## Description
66

7-
<p>For two strings <code>s</code> and <code>t</code>, we say &quot;<code>t</code> divides <code>s</code>&quot; if and only if <code>s = t + ... + t</code> (i.e., <code>t</code> is concatenated with itself one or more times).</p>
7+
<p>For two strings <code>s</code> and <code>t</code>, we say &quot;<code>t</code> divides <code>s</code>&quot; if and only if <code>s = t + t + t + ... + t + t</code> (i.e., <code>t</code> is concatenated with itself one or more times).</p>
88

99
<p>Given two strings <code>str1</code> and <code>str2</code>, return <em>the largest string </em><code>x</code><em> such that </em><code>x</code><em> divides both </em><code>str1</code><em> and </em><code>str2</code>.</p>
1010

‎solution/1000-1099/1074.Number of Submatrices That Sum to Target/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -40,7 +40,7 @@
4040
<ul>
4141
<li><code>1 &lt;= matrix.length &lt;= 100</code></li>
4242
<li><code>1 &lt;= matrix[0].length &lt;= 100</code></li>
43-
<li><code>-1000 &lt;= matrix[i] &lt;= 1000</code></li>
43+
<li><code>-1000 &lt;= matrix[i][j] &lt;= 1000</code></li>
4444
<li><code>-10^8 &lt;= target &lt;= 10^8</code></li>
4545
</ul>
4646

‎solution/1100-1199/1159.Market Analysis II/README_EN.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -53,11 +53,11 @@ item_id is the primary key (column with unique values) of this table.
5353

5454
<p>&nbsp;</p>
5555

56-
<p>Write a solution&nbsp;to find for each user, the join date and the number of orders they made as a buyer in <code>2019</code>.</p>
56+
<p>Write a solutionto find for each user whether the brand of the second item (by date) they sold is their favorite brand. If a user sold less than two items, report the answer for that user as no. It is guaranteed that no seller sells more than one item in a day.</p>
5757

5858
<p>Return the result table in <strong>any order</strong>.</p>
5959

60-
<p>The&nbsp;result format is in the following example.</p>
60+
<p>Theresult format is in the following example.</p>
6161

6262
<p>&nbsp;</p>
6363
<p><strong class="example">Example 1:</strong></p>

‎solution/1400-1499/1403.Minimum Subsequence in Non-Increasing Order/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,7 @@
2424
<pre>
2525
<strong>Input:</strong> nums = [4,4,7,6,7]
2626
<strong>Output:</strong> [7,7,6]
27-
<strong>Explanation:</strong> The subsequence [7,7] has the sum of its elements equal to 14 which is not strictly greater than the sum of elements not included (14 = 4 + 4 + 6). Therefore, the subsequence [7,6,7] is the minimal satisfying the conditions. Note the subsequence has to be returned in non-decreasing order.
27+
<strong>Explanation:</strong> The subsequence [7,7] has the sum of its elements equal to 14 which is not strictly greater than the sum of elements not included (14 = 4 + 4 + 6). Therefore, the subsequence [7,6,7] is the minimal satisfying the conditions. Note the subsequence has to be returned in non-increasing order.
2828
</pre>
2929

3030
<p>&nbsp;</p>

‎solution/2100-2199/2149.Rearrange Array Elements by Sign/README_EN.md‎

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -48,6 +48,9 @@ So nums is rearranged to [1,-1].
4848
<li><code>nums</code> consists of <strong>equal</strong> number of positive and negative integers.</li>
4949
</ul>
5050

51+
<p>&nbsp;</p>
52+
It is not required to do the modifications in-place.
53+
5154
## Solutions
5255

5356
### Solution 1

0 commit comments

Comments
(0)

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