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 ddf74e1

Browse files
author
Shuo
authored
Merge pull request #781 from openset/develop
A: new
2 parents d9bca8a + 4bcee43 commit ddf74e1

File tree

25 files changed

+553
-15
lines changed

25 files changed

+553
-15
lines changed

‎README.md

Lines changed: 7 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -62,6 +62,11 @@ LeetCode Problems' Solutions
6262

6363
| # | Title | Solution | Difficulty |
6464
| :-: | - | - | :-: |
65+
| <span id="1411">1411</span> | [Number of Ways to Paint N ×ばつ 3 Grid](https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid "给 N x 3 网格图涂色的方案数") | [Go](problems/number-of-ways-to-paint-n-3-grid) | Hard |
66+
| <span id="1410">1410</span> | [HTML Entity Parser](https://leetcode.com/problems/html-entity-parser "HTML 实体解析器") | [Go](problems/html-entity-parser) | Medium |
67+
| <span id="1409">1409</span> | [Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key "查询带键的排列") | [Go](problems/queries-on-a-permutation-with-key) | Medium |
68+
| <span id="1408">1408</span> | [String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array "数组中的字符串匹配") | [Go](problems/string-matching-in-an-array) | Easy |
69+
| <span id="1407">1407</span> | [Top Travellers](https://leetcode.com/problems/top-travellers) 🔒 | [MySQL](problems/top-travellers) | Easy |
6570
| <span id="1406">1406</span> | [Stone Game III](https://leetcode.com/problems/stone-game-iii "石子游戏 III") | [Go](problems/stone-game-iii) | Hard |
6671
| <span id="1405">1405</span> | [Longest Happy String](https://leetcode.com/problems/longest-happy-string "最长快乐字符串") | [Go](problems/longest-happy-string) | Medium |
6772
| <span id="1404">1404</span> | [Number of Steps to Reduce a Number in Binary Representation to One](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one "将二进制表示减到 1 的步骤数") | [Go](problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one) | Medium |
@@ -70,7 +75,7 @@ LeetCode Problems' Solutions
7075
| <span id="1401">1401</span> | [Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping "圆和矩形是否有重叠") | [Go](problems/circle-and-rectangle-overlapping) | Medium |
7176
| <span id="1400">1400</span> | [Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings "构造 K 个回文字符串") | [Go](problems/construct-k-palindrome-strings) | Medium |
7277
| <span id="1399">1399</span> | [Count Largest Group](https://leetcode.com/problems/count-largest-group "统计最大组的数目") | [Go](problems/count-largest-group) | Easy |
73-
| <span id="1398">1398</span> | [Customers Who Bought Products A and B but Not C](https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c) 🔒 | [MySQL](problems/customers-who-bought-products-a-and-b-but-not-c) | Medium |
78+
| <span id="1398">1398</span> | [Customers Who Bought Products A and B but Not C](https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c"购买了产品A和产品B却没有购买产品C的顾客") 🔒 | [MySQL](problems/customers-who-bought-products-a-and-b-but-not-c) | Medium |
7479
| <span id="1397">1397</span> | [Find All Good Strings](https://leetcode.com/problems/find-all-good-strings "找到所有好字符串") | [Go](problems/find-all-good-strings) | Hard |
7580
| <span id="1396">1396</span> | [Design Underground System](https://leetcode.com/problems/design-underground-system "设计地铁系统") | [Go](problems/design-underground-system) | Medium |
7681
| <span id="1395">1395</span> | [Count Number of Teams](https://leetcode.com/problems/count-number-of-teams "统计作战单位数") | [Go](problems/count-number-of-teams) | Medium |
@@ -474,7 +479,7 @@ LeetCode Problems' Solutions
474479
| <span id="997">997</span> | [Find the Town Judge](https://leetcode.com/problems/find-the-town-judge "找到小镇的法官") | [Go](problems/find-the-town-judge) | Easy |
475480
| <span id="996">996</span> | [Number of Squareful Arrays](https://leetcode.com/problems/number-of-squareful-arrays "正方形数组的数目") | [Go](problems/number-of-squareful-arrays) | Hard |
476481
| <span id="995">995</span> | [Minimum Number of K Consecutive Bit Flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips "K 连续位的最小翻转次数") | [Go](problems/minimum-number-of-k-consecutive-bit-flips) | Hard |
477-
| <span id="994">994</span> | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges "腐烂的橘子") | [Go](problems/rotting-oranges) | Easy |
482+
| <span id="994">994</span> | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges "腐烂的橘子") | [Go](problems/rotting-oranges) | Medium |
478483
| <span id="993">993</span> | [Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree "二叉树的堂兄弟节点") | [Go](problems/cousins-in-binary-tree) | Easy |
479484
| <span id="992">992</span> | [Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers "K 个不同整数的子数组") | [Go](problems/subarrays-with-k-different-integers) | Hard |
480485
| <span id="991">991</span> | [Broken Calculator](https://leetcode.com/problems/broken-calculator "坏了的计算器") | [Go](problems/broken-calculator) | Medium |

‎problems/best-time-to-buy-and-sell-stock-ii/README.md

Lines changed: 9 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@
1111

1212
## [122. Best Time to Buy and Sell Stock II (Easy)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii "买卖股票的最佳时机 II")
1313

14-
<p>Say you have an array for which the <em>i</em><sup>th</sup> element is the price of a given stock on day <em>i</em>.</p>
14+
<p>Say you have an array <code>prices</code> for which the <em>i</em><sup>th</sup> element is the price of a given stock on day <em>i</em>.</p>
1515

1616
<p>Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).</p>
1717

@@ -43,6 +43,14 @@
4343
<strong>Output:</strong> 0
4444
<strong>Explanation:</strong> In this case, no transaction is done, i.e. max profit = 0.</pre>
4545

46+
<p>&nbsp;</p>
47+
<p><strong>Constraints:</strong></p>
48+
49+
<ul>
50+
<li><code>1 &lt;= prices.length &lt;= 3 * 10 ^ 4</code></li>
51+
<li><code>0 &lt;= prices[i]&nbsp;&lt;= 10 ^ 4</code></li>
52+
</ul>
53+
4654
### Related Topics
4755
[[Greedy](../../tag/greedy/README.md)]
4856
[[Array](../../tag/array/README.md)]

‎problems/customers-who-bought-products-a-and-b-but-not-c/README.md

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

1010
[Next >](../count-largest-group "Count Largest Group")
1111

12-
## [1398. Customers Who Bought Products A and B but Not C (Medium)](https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c "")
12+
## [1398. Customers Who Bought Products A and B but Not C (Medium)](https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c "购买了产品A和产品B却没有购买产品C的顾客")
1313

1414

‎problems/fizz-buzz/README.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -39,3 +39,6 @@ Return:
3939
]
4040
</pre>
4141
</p>
42+
43+
### Similar Questions
44+
1. [Fizz Buzz Multithreaded](../fizz-buzz-multithreaded) (Medium)

‎problems/happy-number/README.md

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -11,9 +11,11 @@
1111

1212
## [202. Happy Number (Easy)](https://leetcode.com/problems/happy-number "快乐数")
1313

14-
<p>Write an algorithm to determine if a number is &quot;happy&quot;.</p>
14+
<p>Write an algorithm to determine if a number <code>n</code> is &quot;happy&quot;.</p>
1515

16-
<p>A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.</p>
16+
<p>A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it <strong>loops endlessly in a cycle</strong> which does not include 1. Those numbers for which this process <strong>ends in 1</strong> are happy numbers.</p>
17+
18+
<p>Return True if <code>n</code> is a happy number, and False if not.</p>
1719

1820
<p><strong>Example:&nbsp;</strong></p>
1921

‎problems/html-entity-parser/README.md

Lines changed: 89 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,89 @@
1+
<!--|This file generated by command(leetcode description); DO NOT EDIT. |-->
2+
<!--+----------------------------------------------------------------------+-->
3+
<!--|@author openset <openset.wang@gmail.com> |-->
4+
<!--|@link https://github.com/openset |-->
5+
<!--|@home https://github.com/openset/leetcode |-->
6+
<!--+----------------------------------------------------------------------+-->
7+
8+
[< Previous](../queries-on-a-permutation-with-key "Queries on a Permutation With Key")
9+
10+
[Next >](../number-of-ways-to-paint-n-3-grid "Number of Ways to Paint N ×ばつ 3 Grid")
11+
12+
## [1410. HTML Entity Parser (Medium)](https://leetcode.com/problems/html-entity-parser "HTML 实体解析器")
13+
14+
<p><strong>HTML entity parser</strong> is the parser that takes HTML code as input and replace all the entities of the special characters by the characters itself.</p>
15+
16+
<p>The special characters and their entities for HTML are:</p>
17+
18+
<ul>
19+
<li><strong>Quotation Mark:</strong>&nbsp;the entity is <code>&amp;quot;</code> and&nbsp;symbol character is <code>&quot;</code>.</li>
20+
<li><strong>Single Quote&nbsp;Mark:</strong>&nbsp;the entity is <code>&amp;apos;</code> and&nbsp;symbol character is <code>&#39;</code>.</li>
21+
<li><strong>Ampersand:</strong>&nbsp;the entity is <code>&amp;amp;</code> and symbol character is <code>&amp;</code>.</li>
22+
<li><strong>Greater Than Sign:</strong>&nbsp;the entity is <code>&amp;gt;</code>&nbsp;and symbol character is <code>&gt;</code>.</li>
23+
<li><strong>Less Than Sign:</strong>&nbsp;the entity is <code>&amp;lt;</code>&nbsp;and symbol character is <code>&lt;</code>.</li>
24+
<li><strong>Slash:</strong>&nbsp;the entity is <code>&amp;frasl;</code> and&nbsp;symbol character is <code>/</code>.</li>
25+
</ul>
26+
27+
<p>Given the input <code>text</code> string to the HTML parser, you have to implement the entity parser.</p>
28+
29+
<p>Return <em>the text</em> after replacing the entities by the special characters.</p>
30+
31+
<p>&nbsp;</p>
32+
<p><strong>Example 1:</strong></p>
33+
34+
<pre>
35+
<strong>Input:</strong> text = &quot;&amp;amp; is an HTML entity but &amp;ambassador; is not.&quot;
36+
<strong>Output:</strong> &quot;&amp; is an HTML entity but &amp;ambassador; is not.&quot;
37+
<strong>Explanation:</strong> The parser will replace the &amp;amp; entity by &amp;
38+
</pre>
39+
40+
<p><strong>Example 2:</strong></p>
41+
42+
<pre>
43+
<strong>Input:</strong> text = &quot;and I quote: &amp;quot;...&amp;quot;&quot;
44+
<strong>Output:</strong> &quot;and I quote: \&quot;...\&quot;&quot;
45+
</pre>
46+
47+
<p><strong>Example 3:</strong></p>
48+
49+
<pre>
50+
<strong>Input:</strong> text = &quot;Stay home! Practice on Leetcode :)&quot;
51+
<strong>Output:</strong> &quot;Stay home! Practice on Leetcode :)&quot;
52+
</pre>
53+
54+
<p><strong>Example 4:</strong></p>
55+
56+
<pre>
57+
<strong>Input:</strong> text = &quot;x &amp;gt; y &amp;amp;&amp;amp; x &amp;lt; y is always false&quot;
58+
<strong>Output:</strong> &quot;x &gt; y &amp;&amp; x &lt; y is always false&quot;
59+
</pre>
60+
61+
<p><strong>Example 5:</strong></p>
62+
63+
<pre>
64+
<strong>Input:</strong> text = &quot;leetcode.com&amp;frasl;problemset&amp;frasl;all&quot;
65+
<strong>Output:</strong> &quot;leetcode.com/problemset/all&quot;
66+
</pre>
67+
68+
<p>&nbsp;</p>
69+
<p><strong>Constraints:</strong></p>
70+
71+
<ul>
72+
<li><code>1 &lt;= text.length &lt;= 10^5</code></li>
73+
<li>The string may contain any possible characters out of all the 256&nbsp;ASCII characters.</li>
74+
</ul>
75+
76+
### Related Topics
77+
[[Stack](../../tag/stack/README.md)]
78+
[[String](../../tag/string/README.md)]
79+
80+
### Hints
81+
<details>
82+
<summary>Hint 1</summary>
83+
Search the string for all the occurrences of the character '&'.
84+
</details>
85+
86+
<details>
87+
<summary>Hint 2</summary>
88+
For every '&' check if it matches an HTML entity by checking the ';' character and if entity found replace it in the answer.
89+
</details>

‎problems/last-stone-weight/README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -11,9 +11,9 @@
1111

1212
## [1046. Last Stone Weight (Easy)](https://leetcode.com/problems/last-stone-weight "最后一块石头的重量")
1313

14-
<p>We have a collection of rocks, each rock has a positive integer weight.</p>
14+
<p>We have a collection of stones, each stone&nbsp;has a positive integer weight.</p>
1515

16-
<p>Each turn, we choose the two <strong>heaviest</strong>&nbsp;rocks&nbsp;and smash them together.&nbsp; Suppose the stones have weights <code>x</code> and <code>y</code> with <code>x &lt;= y</code>.&nbsp; The result of this smash is:</p>
16+
<p>Each turn, we choose the two <strong>heaviest</strong>&nbsp;stones&nbsp;and smash them together.&nbsp; Suppose the stones have weights <code>x</code> and <code>y</code> with <code>x &lt;= y</code>.&nbsp; The result of this smash is:</p>
1717

1818
<ul>
1919
<li>If <code>x == y</code>, both stones are totally destroyed;</li>

‎problems/merge-k-sorted-lists/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,9 +26,9 @@
2626
</pre>
2727

2828
### Related Topics
29+
[[Heap](../../tag/heap/README.md)]
2930
[[Linked List](../../tag/linked-list/README.md)]
3031
[[Divide and Conquer](../../tag/divide-and-conquer/README.md)]
31-
[[Heap](../../tag/heap/README.md)]
3232

3333
### Similar Questions
3434
1. [Merge Two Sorted Lists](../merge-two-sorted-lists) (Easy)
Lines changed: 79 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,79 @@
1+
<!--|This file generated by command(leetcode description); DO NOT EDIT. |-->
2+
<!--+----------------------------------------------------------------------+-->
3+
<!--|@author openset <openset.wang@gmail.com> |-->
4+
<!--|@link https://github.com/openset |-->
5+
<!--|@home https://github.com/openset/leetcode |-->
6+
<!--+----------------------------------------------------------------------+-->
7+
8+
[< Previous](../html-entity-parser "HTML Entity Parser")
9+
10+
Next >
11+
12+
## [1411. Number of Ways to Paint N ×ばつ 3 Grid (Hard)](https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid "给 N x 3 网格图涂色的方案数")
13+
14+
<p>You have a <code>grid</code> of size <code>n x 3</code> and you want to paint each cell of the grid with exactly&nbsp;one of the three colours: <strong>Red</strong>, <strong>Yellow</strong> or <strong>Green</strong>&nbsp;while making sure that no two adjacent cells have&nbsp;the same colour (i.e no two cells that share vertical or horizontal sides have the same colour).</p>
15+
16+
<p>You are given <code>n</code> the number of rows of the grid.</p>
17+
18+
<p>Return <em>the number of ways</em> you can paint this <code>grid</code>. As the answer may grow large, the answer <strong>must be</strong> computed modulo&nbsp;<code>10^9 + 7</code>.</p>
19+
20+
<p>&nbsp;</p>
21+
<p><strong>Example 1:</strong></p>
22+
23+
<pre>
24+
<strong>Input:</strong> n = 1
25+
<strong>Output:</strong> 12
26+
<strong>Explanation:</strong> There are 12 possible way to paint the grid as shown:
27+
<img alt="" src="https://assets.leetcode.com/uploads/2020/03/26/e1.png" style="width: 450px; height: 289px;" />
28+
</pre>
29+
30+
<p><strong>Example 2:</strong></p>
31+
32+
<pre>
33+
<strong>Input:</strong> n = 2
34+
<strong>Output:</strong> 54
35+
</pre>
36+
37+
<p><strong>Example 3:</strong></p>
38+
39+
<pre>
40+
<strong>Input:</strong> n = 3
41+
<strong>Output:</strong> 246
42+
</pre>
43+
44+
<p><strong>Example 4:</strong></p>
45+
46+
<pre>
47+
<strong>Input:</strong> n = 7
48+
<strong>Output:</strong> 106494
49+
</pre>
50+
51+
<p><strong>Example 5:</strong></p>
52+
53+
<pre>
54+
<strong>Input:</strong> n = 5000
55+
<strong>Output:</strong> 30228214
56+
</pre>
57+
58+
<p>&nbsp;</p>
59+
<p><strong>Constraints:</strong></p>
60+
61+
<ul>
62+
<li><code>n == grid.length</code></li>
63+
<li><code>grid[i].length == 3</code></li>
64+
<li><code>1 &lt;= n &lt;= 5000</code></li>
65+
</ul>
66+
67+
### Related Topics
68+
[[Dynamic Programming](../../tag/dynamic-programming/README.md)]
69+
70+
### Hints
71+
<details>
72+
<summary>Hint 1</summary>
73+
We will use Dynamic programming approach. we will try all possible configuration.
74+
</details>
75+
76+
<details>
77+
<summary>Hint 2</summary>
78+
Let dp[idx][prev1col][prev2col][prev3col] be the number of ways to color the rows of the grid from idx to n-1 keeping in mind that the previous row (idx - 1) has colors prev1col, prev2col and prev3col. Build the dp array to get the answer.
79+
</details>
Lines changed: 72 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,72 @@
1+
<!--|This file generated by command(leetcode description); DO NOT EDIT. |-->
2+
<!--+----------------------------------------------------------------------+-->
3+
<!--|@author openset <openset.wang@gmail.com> |-->
4+
<!--|@link https://github.com/openset |-->
5+
<!--|@home https://github.com/openset/leetcode |-->
6+
<!--+----------------------------------------------------------------------+-->
7+
8+
[< Previous](../string-matching-in-an-array "String Matching in an Array")
9+
10+
[Next >](../html-entity-parser "HTML Entity Parser")
11+
12+
## [1409. Queries on a Permutation With Key (Medium)](https://leetcode.com/problems/queries-on-a-permutation-with-key "查询带键的排列")
13+
14+
<p>Given the array <code>queries</code> of positive integers between <code>1</code> and <code>m</code>, you have to process all <code>queries[i]</code> (from <code>i=0</code> to <code>i=queries.length-1</code>) according to the following rules:</p>
15+
16+
<ul>
17+
<li>In the beginning, you have the permutation <code>P=[1,2,3,...,m]</code>.</li>
18+
<li>For the current <code>i</code>, find the position of <code>queries[i]</code> in the permutation <code>P</code> (<strong>indexing from 0</strong>) and then move this at the beginning of the permutation <code>P.</code>&nbsp;Notice that the position of <code>queries[i]</code> in <code>P</code> is the result for <code>queries[i]</code>.</li>
19+
</ul>
20+
21+
<p>Return an array containing the result for the given <code>queries</code>.</p>
22+
23+
<p>&nbsp;</p>
24+
<p><strong>Example 1:</strong></p>
25+
26+
<pre>
27+
<strong>Input:</strong> queries = [3,1,2,1], m = 5
28+
<strong>Output:</strong> [2,1,2,1]
29+
<strong>Explanation:</strong> The queries are processed as follow:
30+
For i=0: queries[i]=3, P=[1,2,3,4,5], position of 3 in P is <strong>2</strong>, then we move 3 to the beginning of P resulting in P=[3,1,2,4,5].
31+
For i=1: queries[i]=1, P=[3,1,2,4,5], position of 1 in P is <strong>1</strong>, then we move 1 to the beginning of P resulting in P=[1,3,2,4,5].
32+
For i=2: queries[i]=2, P=[1,3,2,4,5], position of 2 in P is <strong>2</strong>, then we move 2 to the beginning of P resulting in P=[2,1,3,4,5].
33+
For i=3: queries[i]=1, P=[2,1,3,4,5], position of 1 in P is <strong>1</strong>, then we move 1 to the beginning of P resulting in P=[1,2,3,4,5].
34+
Therefore, the array containing the result is [2,1,2,1].
35+
</pre>
36+
37+
<p><strong>Example 2:</strong></p>
38+
39+
<pre>
40+
<strong>Input:</strong> queries = [4,1,2,2], m = 4
41+
<strong>Output:</strong> [3,1,2,0]
42+
</pre>
43+
44+
<p><strong>Example 3:</strong></p>
45+
46+
<pre>
47+
<strong>Input:</strong> queries = [7,5,5,8,3], m = 8
48+
<strong>Output:</strong> [6,5,0,7,5]
49+
</pre>
50+
51+
<p>&nbsp;</p>
52+
<p><strong>Constraints:</strong></p>
53+
54+
<ul>
55+
<li><code>1 &lt;= m &lt;= 10^3</code></li>
56+
<li><code>1 &lt;= queries.length &lt;= m</code></li>
57+
<li><code>1 &lt;= queries[i] &lt;= m</code></li>
58+
</ul>
59+
60+
### Related Topics
61+
[[Array](../../tag/array/README.md)]
62+
63+
### Hints
64+
<details>
65+
<summary>Hint 1</summary>
66+
Create the permutation P=[1,2,...,m], it could be a list for example.
67+
</details>
68+
69+
<details>
70+
<summary>Hint 2</summary>
71+
For each i, find the position of queries[i] with a simple scan over P and then move this to the beginning.
72+
</details>

0 commit comments

Comments
(0)

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