You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
| <spanid="1278">1278</span> |[Palindrome Partitioning III](https://leetcode.com/problems/palindrome-partitioning-iii"分割回文串 III")|[Go](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-iii)| Hard |
66
67
| <spanid="1277">1277</span> |[Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones"统计全为 1 的正方形子矩阵")|[Go](https://github.com/openset/leetcode/tree/master/problems/count-square-submatrices-with-all-ones)| Medium |
67
68
| <spanid="1276">1276</span> |[Number of Burgers with No Waste of Ingredients](https://leetcode.com/problems/number-of-burgers-with-no-waste-of-ingredients"不浪费原料的汉堡制作方案")|[Go](https://github.com/openset/leetcode/tree/master/problems/number-of-burgers-with-no-waste-of-ingredients)| Medium |
68
69
| <spanid="1275">1275</span> |[Find Winner on a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game"找出井字棋的获胜者")|[Go](https://github.com/openset/leetcode/tree/master/problems/find-winner-on-a-tic-tac-toe-game)| Easy |
69
-
| <spanid="1274">1274</span> |[Number of Ships in a Rectangle](https://leetcode.com/problems/number-of-ships-in-a-rectangle"矩形内船只的数目")|[Go](https://github.com/openset/leetcode/tree/master/problems/number-of-ships-in-a-rectangle)| Hard |
70
-
| <spanid="1273">1273</span> |[Delete Tree Nodes](https://leetcode.com/problems/delete-tree-nodes"删除树节点")|[Go](https://github.com/openset/leetcode/tree/master/problems/delete-tree-nodes)| Medium |
71
-
| <spanid="1272">1272</span> |[Remove Interval](https://leetcode.com/problems/remove-interval"删除区间")|[Go](https://github.com/openset/leetcode/tree/master/problems/remove-interval)| Medium |
| <spanid="1274">1274</span> |[Number of Ships in a Rectangle](https://leetcode.com/problems/number-of-ships-in-a-rectangle"矩形内船只的数目")🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/number-of-ships-in-a-rectangle)| Hard |
71
+
| <spanid="1273">1273</span> |[Delete Tree Nodes](https://leetcode.com/problems/delete-tree-nodes"删除树节点")🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/delete-tree-nodes)| Medium |
72
+
| <spanid="1272">1272</span> |[Remove Interval](https://leetcode.com/problems/remove-interval"删除区间")🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/remove-interval)| Medium |
| <spanid="1270">1270</span> |[All People Report to the Given Manager](https://leetcode.com/problems/all-people-report-to-the-given-manager) 🔒 |[MySQL](https://github.com/openset/leetcode/tree/master/problems/all-people-report-to-the-given-manager)| Medium |
74
75
| <spanid="1269">1269</span> |[Number of Ways to Stay in the Same Place After Some Steps](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps"停在原地的方案数")|[Go](https://github.com/openset/leetcode/tree/master/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps)| Hard |
75
76
| <spanid="1268">1268</span> |[Search Suggestions System](https://leetcode.com/problems/search-suggestions-system"搜索推荐系统")|[Go](https://github.com/openset/leetcode/tree/master/problems/search-suggestions-system)| Medium |
Copy file name to clipboardExpand all lines: problems/minimum-moves-to-move-a-box-to-their-target-location/README.md
+5-3
Original file line number
Diff line number
Diff line change
@@ -13,7 +13,7 @@
13
13
14
14
<p>Storekeeper is a game in which the player pushes boxes around in a warehouse trying to get them to target locations.</p>
15
15
16
-
<p>The game is represented by a <code>grid</code> of size <code>n<fontface="sans-serif, Arial, Verdana, Trebuchet MS">*</font></code><code>m</code>, where each element is a wall, floor, or a box.</p>
16
+
<p>The game is represented by a <code>grid</code> of size <code>m x n</code>, where each element is a wall, floor, or a box.</p>
17
17
18
18
<p>Your task is move the box <code>'B'</code> to the target position <code>'T'</code> under the following rules:</p>
<li><code>grid</code> contains only characters <code>'.'</code>, <code>'#'</code>, <code>'S'</code> , <code>'T'</code>, or <code>'B'</code>.</li>
87
89
<li>There is only one character <code>'S'</code>, <code>'B'</code> <font face="sans-serif, Arial, Verdana, Trebuchet MS">and </font><code>'T'</code> in the <code>grid</code>.</li>
Copy file name to clipboardExpand all lines: problems/palindrome-partitioning-iii/README.md
+1-1
Original file line number
Diff line number
Diff line change
@@ -7,7 +7,7 @@
7
7
8
8
[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-square-submatrices-with-all-ones"Count Square Submatrices with All Ones")
<strong>Explanation: </strong>Given the above binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B.
43
+
<pre>
44
+
<strong>Input:</strong> root = [1,2,3,4,5,null,7]
45
+
<strong>Output:</strong> [1,#,2,3,#,4,5,7,#]
46
+
<strong>Explanation: </strong>Given the above binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.
41
47
</pre>
42
48
43
49
<p> </p>
44
-
45
-
<p><strong>Note:</strong></p>
50
+
<p><strong>Constraints:</strong></p>
46
51
47
52
<ul>
48
-
<li>You may only use constant extra space.</li>
49
-
<li>Recursive approach is fine, implicit stack space does not count as extra space for this problem.</li>
53
+
<li>The number of nodes in the given tree is less than <code>6000</code>.</li>
<strong>Explanation: </strong>Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B.
43
+
<pre>
44
+
<strong>Input:</strong> root = [1,2,3,4,5,6,7]
45
+
<strong>Output:</strong> [1,#,2,3,#,4,5,6,7,#]
46
+
<strong>Explanation: </strong>Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.
41
47
</pre>
42
48
43
49
<p> </p>
44
-
45
-
<p><strong>Note:</strong></p>
50
+
<p><strong>Constraints:</strong></p>
46
51
47
52
<ul>
48
-
<li>You may only use constant extra space.</li>
49
-
<li>Recursive approach is fine, implicit stack space does not count as extra space for this problem.</li>
53
+
<li>The number of nodes in the given tree is less than <code>4096</code>.</li>
<p>Given a 2D <code>grid</code> of size <code>n</code> * <code>m</code> and an integer <code>k</code>. You need to shift the <code>grid</code> <code>k</code> times.</p>
14
+
<p>Given a 2D <code>grid</code> of size <code>m x n</code> and an integer <code>k</code>. You need to shift the <code>grid</code> <code>k</code> times.</p>
15
15
16
16
<p>In one shift operation:</p>
17
17
18
18
<ul>
19
19
<li>Element at <code>grid[i][j]</code> becomes at <code>grid[i][j + 1]</code>.</li>
20
-
<li>Element at <code>grid[i][m - 1]</code> becomes at <code>grid[i + 1][0]</code>.</li>
21
-
<li>Element at <code>grid[n - 1][m - 1]</code> becomes at <code>grid[0][0]</code>.</li>
20
+
<li>Element at <code>grid[i][n - 1]</code> becomes at <code>grid[i + 1][0]</code>.</li>
21
+
<li>Element at <code>grid[n - 1][n - 1]</code> becomes at <code>grid[0][0]</code>.</li>
22
22
</ul>
23
23
24
24
<p>Return the <em>2D grid</em> after applying shift operation <code>k</code> times.</p>
Copy file name to clipboardExpand all lines: problems/similar-string-groups/README.md
+11-11
Original file line number
Diff line number
Diff line change
@@ -19,22 +19,22 @@
19
19
20
20
<p>We are given a list <code>A</code> of strings. Every string in <code>A</code> is an anagram of every other string in <code>A</code>. How many groups are there?</p>
| <spanid="752">752</span> |[Open the Lock](https://leetcode.com/problems/open-the-lock"打开转盘锁")|[Go](https://github.com/openset/leetcode/tree/master/problems/open-the-lock)| Medium |
217
217
| <spanid="753">753</span> |[Cracking the Safe](https://leetcode.com/problems/cracking-the-safe"破解保险箱")|[Go](https://github.com/openset/leetcode/tree/master/problems/cracking-the-safe)| Hard |
218
-
| <spanid="754">754</span> |[Reach a Number](https://leetcode.com/problems/reach-a-number"到达终点数字")|[Go](https://github.com/openset/leetcode/tree/master/problems/reach-a-number)|Easy|
218
+
| <spanid="754">754</span> |[Reach a Number](https://leetcode.com/problems/reach-a-number"到达终点数字")|[Go](https://github.com/openset/leetcode/tree/master/problems/reach-a-number)|Medium|
219
219
| <spanid="755">755</span> |[Pour Water](https://leetcode.com/problems/pour-water"倒水") 🔒 |[Go](https://github.com/openset/leetcode/tree/master/problems/pour-water)| Medium |
220
220
| <spanid="756">756</span> |[Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix"金字塔转换矩阵")|[Go](https://github.com/openset/leetcode/tree/master/problems/pyramid-transition-matrix)| Medium |
221
221
| <spanid="757">757</span> |[Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two" 设置交集大小至少为2")|[Go](https://github.com/openset/leetcode/tree/master/problems/set-intersection-size-at-least-two)| Hard |
0 commit comments