Merge pull request #600 from openset/develop

Add: new

Author: Shuo

README.md

@@ -54,6 +54,12 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
+| <span id="1102">1102</span> | [Path With Maximum Minimum Value](https://leetcode.com/problems/path-with-maximum-minimum-value "得分最高的路径") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/path-with-maximum-minimum-value) | Medium |
+| <span id="1101">1101</span> | [The Earliest Moment When Everyone Become Friends](https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends "彼此熟识的最早时间") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/the-earliest-moment-when-everyone-become-friends) | Medium |
+| <span id="1100">1100</span> | [Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters "长度为 K 的无重复字符子串") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/find-k-length-substrings-with-no-repeated-characters) | Medium |
+| <span id="1099">1099</span> | [Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k "小于 K 的两数之和") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/two-sum-less-than-k) | Easy |
+| <span id="1098">1098</span> | [Unpopular Books](https://leetcode.com/problems/unpopular-books) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/unpopular-books) | Medium |
+| <span id="1097">1097</span> | [Game Play Analysis V](https://leetcode.com/problems/game-play-analysis-v) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-v) | Hard |
 | <span id="1096">1096</span> | [Brace Expansion II](https://leetcode.com/problems/brace-expansion-ii "花括号展开 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/brace-expansion-ii) | Hard |
 | <span id="1095">1095</span> | [Find in Mountain Array](https://leetcode.com/problems/find-in-mountain-array "山脉数组中查找目标值") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-in-mountain-array) | Hard |
 | <span id="1094">1094</span> | [Car Pooling](https://leetcode.com/problems/car-pooling "拼车") | [Go](https://github.com/openset/leetcode/tree/master/problems/car-pooling) | Medium |

problems/3sum-smaller/README.md

@@ -21,3 +21,4 @@
   1. [3Sum](https://github.com/openset/leetcode/tree/master/problems/3sum) (Medium)
   1. [3Sum Closest](https://github.com/openset/leetcode/tree/master/problems/3sum-closest) (Medium)
   1. [Valid Triangle Number](https://github.com/openset/leetcode/tree/master/problems/valid-triangle-number) (Medium)
+  1. [Two Sum Less Than K](https://github.com/openset/leetcode/tree/master/problems/two-sum-less-than-k) (Easy)

problems/brace-expansion-ii/README.md

@@ -7,7 +7,7 @@
 
 [< Previous](https://github.com/openset/leetcode/tree/master/problems/find-in-mountain-array "Find in Mountain Array")
 
-Next >
+[Next >](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-v "Game Play Analysis V")
 
 ## 1096. Brace Expansion II (Hard)
 
@@ -31,7 +31,7 @@ Next >
 	<li>When we concatenate two expressions, we take the set of possible concatenations between two words where the first word comes from the first expression and the second word comes from the second expression.
 	<ul>
 		<li><code>R(&quot;{a,b}{c,d}&quot;) = {&quot;ac&quot;,&quot;ad&quot;,&quot;bc&quot;,&quot;bd&quot;}</code></li>
-		<li><code>R(&quot;{a{b,c}}{{d,e},f{g,h}}&quot;) = R(&quot;{ab,ac}{dfg,dfh,efg,efh}&quot;) = {&quot;abdfg&quot;, &quot;abdfh&quot;, &quot;abefg&quot;, &quot;abefh&quot;, &quot;acdfg&quot;, &quot;acdfh&quot;, &quot;acefg&quot;, &quot;acefh&quot;}</code></li>
+		<li><code>R(&quot;{a{b,c}}{{d,e}f{g,h}}&quot;) = R(&quot;{ab,ac}{dfg,dfh,efg,efh}&quot;) = {&quot;abdfg&quot;, &quot;abdfh&quot;, &quot;abefg&quot;, &quot;abefh&quot;, &quot;acdfg&quot;, &quot;acdfh&quot;, &quot;acefg&quot;, &quot;acefh&quot;}</code></li>
 	</ul>
 	</li>
 </ul>
@@ -76,3 +76,12 @@ Next >
 </ol>
 </div>
 </div>
+
+### Related Topics
+  [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+You can write helper methods to parse the next "chunk" of the expression.  If you see eg. "a", the answer is just the set {a}.  If you see "{", you parse until you complete the "}" (the number of { and } seen are equal) and that becomes a chunk that you find where the appropriate commas are, and parse each individual expression between the commas.
+</details>

problems/car-fleet/README.md

@@ -52,4 +52,4 @@ Note that no other cars meet these fleets before the destination, so the answer
 </ol>
 
 ### Related Topics
-  [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)]
+  [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)]

problems/car-pooling/README.md

@@ -71,3 +71,12 @@
 	<li><code>0 &lt;= trips[i][1] &lt; trips[i][2] &lt;= 1000</code></li>
 	<li><code>1 &lt;=&nbsp;capacity &lt;= 100000</code></li>
 </ol>
+
+### Related Topics
+  [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+Sort the pickup and dropoff events by location, then process them in order.
+</details>

problems/construct-quad-tree/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree "Serialize and Deserialize N-ary Tree")
 
-## 427. Construct Quad Tree (Easy)
+## 427. Construct Quad Tree (Medium)
 
 <p>We want to use quad trees to store an <code>N x N</code> boolean grid. Each cell in the grid can only be true or false. The root node represents the whole grid. For each node, it will be subdivided into four children nodes <strong>until the values in the region it represents are all the same</strong>.</p>
 

problems/continuous-subarray-sum/README.md

@@ -11,7 +11,7 @@
 
 ## 523. Continuous Subarray Sum (Medium)
 
-<p>Given a list of <b>non-negative</b> numbers and a target <b>integer</b> k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of <b>k</b>, that is, sums up to n*k where n is also an <b>integer</b>.</p>
+<p>Given a list of <b>non-negative</b> numbers and a target <b>integer</b> k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to a multiple of <b>k</b>, that is, sums up to n*k where n is also an <b>integer</b>.</p>
 
 <p>&nbsp;</p>
 

problems/cracking-the-safe/README.md

@@ -11,39 +11,43 @@
 
 ## 753. Cracking the Safe (Hard)
 
-<p>
-There is a box protected by a password.  The password is <code>n</code> digits, where each letter can be one of the first <code>k</code> digits <code>0, 1, ..., k-1</code>.
-</p><p>
-You can keep inputting the password, the password will automatically be matched against the last <code>n</code> digits entered.
-</p><p>
-For example, assuming the password is <code>"345"</code>, I can open it when I type <code>"012345"</code>, but I enter a total of 6 digits.
-</p><p>
-Please return any string of minimum length that is guaranteed to open the box after the entire string is inputted.
-</p>
-
-<p><b>Example 1:</b><br />
+<p>There is a box protected by a password. The password is a sequence of&nbsp;<code>n</code> digits&nbsp;where each digit can be one of the first <code>k</code> digits <code>0, 1, ..., k-1</code>.</p>
+
+<p>While entering a password,&nbsp;the last <code>n</code> digits entered will automatically be matched against the correct password.</p>
+
+<p>For example, assuming the correct password is <code>&quot;345&quot;</code>,&nbsp;if you type <code>&quot;012345&quot;</code>, the box will open because the correct password matches the suffix of the entered password.</p>
+
+<p>Return any password of <strong>minimum length</strong> that is guaranteed to open the box at some point of entering it.</p>
+
+<p>&nbsp;</p>
+
+<p><b>Example 1:</b></p>
+
 <pre>
 <b>Input:</b> n = 1, k = 2
-<b>Output:</b> "01"
-<b>Note:</b> "10" will be accepted too.
+<b>Output:</b> &quot;01&quot;
+<b>Note:</b> &quot;10&quot; will be accepted too.
 </pre>
-</p>
 
-<p><b>Example 2:</b><br />
+<p><b>Example 2:</b></p>
+
 <pre>
 <b>Input:</b> n = 2, k = 2
-<b>Output:</b> "00110"
-<b>Note:</b> "01100", "10011", "11001" will be accepted too.
+<b>Output:</b> &quot;00110&quot;
+<b>Note:</b> &quot;01100&quot;, &quot;10011&quot;, &quot;11001&quot; will be accepted too.
 </pre>
-</p>
 
-<p><b>Note:</b><br>
+<p>&nbsp;</p>
+
+<p><b>Note:</b></p>
+
 <ol>
-<li><code>n</code> will be in the range <code>[1, 4]</code>.</li>
-<li><code>k</code> will be in the range <code>[1, 10]</code>.</li>
-<li><code>k^n</code> will be at most <code>4096</code>.</li>
+	<li><code>n</code> will be in the range <code>[1, 4]</code>.</li>
+	<li><code>k</code> will be in the range <code>[1, 10]</code>.</li>
+	<li><code>k^n</code> will be at most <code>4096</code>.</li>
 </ol>
-</p>
+
+<p>&nbsp;</p>
 
 ### Related Topics
   [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]

problems/decode-string/README.md

@@ -11,25 +11,23 @@
 
 ## 394. Decode String (Medium)
 
-<p>
-Given an encoded string, return it's decoded string.
-</p>
-<p>
-The encoding rule is: <code>k[encoded_string]</code>, where the <i>encoded_string</i> inside the square brackets is being repeated exactly <i>k</i> times. Note that <i>k</i> is guaranteed to be a positive integer.</p>
+<p>Given an encoded string, return its decoded string.</p>
 
-<p>
-You may assume that the input string is always valid; No extra white spaces, square brackets are well-formed, etc.</p>
+<p>The encoding rule is: <code>k[encoded_string]</code>, where the <i>encoded_string</i> inside the square brackets is being repeated exactly <i>k</i> times. Note that <i>k</i> is guaranteed to be a positive integer.</p>
 
-<p>Furthermore, you may assume that the original data does not contain any digits and that digits are only for those repeat numbers, <i>k</i>. For example, there won't be input like <code>3a</code> or <code>2[4]</code>.
-</p>
+<p>You may assume that the input string is always valid; No extra white spaces, square brackets are well-formed, etc.</p>
+
+<p>Furthermore, you may assume that the original data does not contain any digits and that digits are only for those repeat numbers, <i>k</i>. For example, there won&#39;t be input like <code>3a</code> or <code>2[4]</code>.</p>
+
+<p><b>Examples:</b></p>
 
-<p><b>Examples:</b>
 <pre>
-s = "3[a]2[bc]", return "aaabcbc".
-s = "3[a2[c]]", return "accaccacc".
-s = "2[abc]3[cd]ef", return "abcabccdcdcdef".
+s = &quot;3[a]2[bc]&quot;, return &quot;aaabcbc&quot;.
+s = &quot;3[a2[c]]&quot;, return &quot;accaccacc&quot;.
+s = &quot;2[abc]3[cd]ef&quot;, return &quot;abcabccdcdcdef&quot;.
 </pre>
-</p>
+
+<p>&nbsp;</p>
 
 ### Related Topics
   [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)]
@@ -38,4 +36,4 @@ s = "2[abc]3[cd]ef", return "abcabccdcdcdef".
 ### Similar Questions
   1. [Encode String with Shortest Length](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) (Hard)
   1. [Number of Atoms](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) (Hard)
-  1. [Permutation of Letters](https://github.com/openset/leetcode/tree/master/problems/permutation-of-letters) (Medium)
+  1. [Brace Expansion](https://github.com/openset/leetcode/tree/master/problems/brace-expansion) (Medium)

problems/design-compressed-string-iterator/README.md

@@ -52,5 +52,5 @@ iterator.next(); // return ' '
   [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)]
 
 ### Similar Questions
-  1. [LRU Cache](https://github.com/openset/leetcode/tree/master/problems/lru-cache) (Hard)
+  1. [LRU Cache](https://github.com/openset/leetcode/tree/master/problems/lru-cache) (Medium)
   1. [String Compression](https://github.com/openset/leetcode/tree/master/problems/string-compression) (Easy)