Merge pull request #687 from openset/develop

Update: daily update

Author: Shuo

README.md

@@ -103,7 +103,7 @@ LeetCode Problems' Solutions
 | <span id="1182">1182</span> | [Shortest Distance to Target Color](https://leetcode.com/problems/shortest-distance-to-target-color "与目标颜色间的最短距离") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-target-color) | Medium |
 | <span id="1181">1181</span> | [Before and After Puzzle](https://leetcode.com/problems/before-and-after-puzzle "前后拼接") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/before-and-after-puzzle) | Medium |
 | <span id="1180">1180</span> | [Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter "统计只含单一字母的子串") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/count-substrings-with-only-one-distinct-letter) | Easy |
-| <span id="1179">1179</span> | [Reformat Department Table](https://leetcode.com/problems/reformat-department-table) | [MySQL](https://github.com/openset/leetcode/tree/master/problems/reformat-department-table) | Easy |
+| <span id="1179">1179</span> | [Reformat Department Table](https://leetcode.com/problems/reformat-department-table "重新格式化部门表") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/reformat-department-table) | Easy |
 | <span id="1178">1178</span> | [Number of Valid Words for Each Puzzle](https://leetcode.com/problems/number-of-valid-words-for-each-puzzle "猜字谜") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-valid-words-for-each-puzzle) | Hard |
 | <span id="1177">1177</span> | [Can Make Palindrome from Substring](https://leetcode.com/problems/can-make-palindrome-from-substring "构建回文串检测") | [Go](https://github.com/openset/leetcode/tree/master/problems/can-make-palindrome-from-substring) | Medium |
 | <span id="1176">1176</span> | [Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance "健身计划评估") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/diet-plan-performance) | Easy |

problems/additive-number/README.md

@@ -19,22 +19,32 @@
 
 <p><b>Note:</b> Numbers in the additive sequence <b>cannot</b> have leading zeros, so sequence <code>1, 2, 03</code> or <code>1, 02, 3</code> is invalid.</p>
 
-<p><b>Example 1:</b></p>
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
 
 <pre>
-<b>Input:</b> <code>&quot;112358&quot;</code>
-<b>Output:</b> true 
-<strong>Explanation: </strong>The digits can form an additive sequence: <code>1, 1, 2, 3, 5, 8</code>. 
+<strong>Input:</strong> &quot;112358&quot;
+<strong>Output:</strong> true
+<strong>Explanation:</strong> The digits can form an additive sequence: 1, 1, 2, 3, 5, 8. 
 &nbsp;            1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8
 </pre>
 
-<p><b>Example 2:</b></p>
+<p><strong>Example 2:</strong></p>
 
 <pre>
-<b>Input:</b> <code>&quot;199100199&quot;</code>
-<b>Output:</b> true 
-<strong>Explanation: </strong>The additive sequence is: <code>1, 99, 100, 199</code><span style="font-family: sans-serif, Arial, Verdana, &quot;Trebuchet MS&quot;;">.</span>&nbsp;
-&nbsp;            1 + 99 = 100, 99 + 100 = 199</pre>
+<strong>Input:</strong> &quot;199100199&quot;
+<strong>Output:</strong> true
+<strong>Explanation:</strong> The additive sequence is: 1, 99, 100, 199.&nbsp;
+&nbsp;            1 + 99 = 100, 99 + 100 = 199
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><font face="monospace"><code>num</code>&nbsp;</font>consists only of digits <code>&#39;0&#39;-&#39;9&#39;</code>.</li>
+	<li><code>1 &lt;= num.length &lt;= 35</code></li>
+</ul>
 
 <p><b>Follow up:</b><br />
 How would you handle overflow for very large input integers?</p>

problems/alphabet-board-path/README.md

@@ -46,3 +46,18 @@
 	<li><code>1 &lt;= target.length &lt;= 100</code></li>
 	<li><code>target</code> consists only of English lowercase letters.</li>
 </ul>
+
+### Related Topics
+  [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]
+  [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+Create a hashmap from letter to position on the board.
+</details>
+
+<details>
+<summary>Hint 2</summary>
+Now for each letter, try moving there in steps, where at each step you check if it is inside the boundaries of the board.
+</details>

problems/binary-tree-coloring-game/README.md

@@ -42,3 +42,14 @@
 ### Related Topics
   [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]
   [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+The best move y must be immediately adjacent to x, since it locks out that subtree.
+</details>
+
+<details>
+<summary>Hint 2</summary>
+Can you count each of (up to) 3 different subtrees neighboring x?
+</details>

problems/brace-expansion-ii/README.md

@@ -31,7 +31,7 @@
 	<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;)&nbsp;= {&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>
@@ -52,8 +52,8 @@
 <p><strong>Example 1:</strong></p>
 
 <pre>
-<strong>Input: </strong><span id="example-input-1-1">&quot;{a,b}{c{d,e}}&quot;</span>
-<strong>Output: </strong><span id="example-output-1">[&quot;acd&quot;,&quot;ace&quot;,&quot;bcd&quot;,&quot;bce&quot;]</span>
+<strong>Input: </strong><span id="example-input-1-1">&quot;{a,b}{c,{d,e}}&quot;</span>
+<strong>Output: </strong><span id="example-output-1">[&quot;ac&quot;,&quot;ad&quot;,&quot;ae&quot;,&quot;bc&quot;,&quot;bd&quot;,&quot;be&quot;]</span>
 </pre>
 
 <div>
@@ -70,7 +70,7 @@
 <p><strong>Constraints:</strong></p>
 
 <ol>
-	<li><code>1 &lt;= expression.length &lt;= 50</code></li>
+	<li><code>1 &lt;= expression.length &lt;= 60</code></li>
 	<li><code>expression[i]</code> consists of <code>&#39;{&#39;</code>, <code>&#39;}&#39;</code>, <code>&#39;,&#39;</code>or lowercase English letters.</li>
 	<li>The given&nbsp;<code>expression</code>&nbsp;represents a set of words based on the grammar given in the description.</li>
 </ol>

problems/building-h2o/README.md

@@ -9,9 +9,9 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-days-in-a-month "Number of Days in a Month")
 
-## [1117. Building H2O (Hard)](https://leetcode.com/problems/building-h2o "H2O 生成")
+## [1117. Building H2O (Medium)](https://leetcode.com/problems/building-h2o "H2O 生成")
 
-<p>There are two kinds of threads, <code>oxygen</code> and <code>hydrogen</code>. Your goal is to group these threads to form water molecules.&nbsp;There is a barrier where each thread has to&nbsp;wait until a complete molecule can be formed. Hydrogen and oxygen threads will be given a <code>releaseHydrogen</code>&nbsp;and <code>releaseOxygen</code>&nbsp;method respectfully, which will allow them to pass the barrier. These threads should pass the barrier in groups of three, and they must be able to immediately bond with each other to form a water molecule.&nbsp;You must guarantee that all the threads from one molecule bond <em>before</em> any other threads from the next molecule do.</p>
+<p>There are two kinds of threads, <code>oxygen</code> and <code>hydrogen</code>. Your goal is to group these threads to form water molecules.&nbsp;There is a barrier where each thread has to&nbsp;wait until a complete molecule can be formed. Hydrogen and oxygen threads will be given <code>releaseHydrogen</code>&nbsp;and <code>releaseOxygen</code>&nbsp;methods respectively, which will allow them to pass the barrier. These threads should pass the barrier in groups of three, and they must be able to immediately bond with each other to form a water molecule.&nbsp;You must guarantee that all the threads from one molecule bond <em>before</em> any other threads from the next molecule do.</p>
 
 <p>In other words:</p>
 
@@ -20,6 +20,8 @@
 	<li>If a hydrogen thread arrives at the barrier when no other threads are present, it has to wait for an oxygen thread and another hydrogen thread.</li>
 </ul>
 
+<p>We don&rsquo;t have to worry about matching the threads up explicitly; that is, the threads do not necessarily know which other threads they are paired up with. The key is just that threads pass the barrier in complete sets; thus, if we examine the sequence of threads that bond and divide them into groups of three, each group should contain one oxygen and two hydrogen threads.</p>
+
 <p>Write synchronization code for oxygen and hydrogen molecules that enforces these constraints.</p>
 
 <div>
@@ -50,7 +52,7 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-	<li>Total length of input string will be 3<em>n</em>, where 1 &le;&nbsp;<em>n</em>&nbsp;&le; 50.</li>
+	<li>Total length of input string will be 3<em>n</em>, where 1 &le;&nbsp;<em>n</em>&nbsp;&le; 20.</li>
 	<li>Total number of <code>H</code> will be 2<em>n</em>&nbsp;in the input string.</li>
 	<li>Total number of <code>O</code> will&nbsp;be <em>n</em>&nbsp;in the input&nbsp;string.</li>
 </ul>

problems/bulls-and-cows/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence "Longest Increasing Subsequence")
 
-## [299. Bulls and Cows (Medium)](https://leetcode.com/problems/bulls-and-cows "猜数字游戏")
+## [299. Bulls and Cows (Easy)](https://leetcode.com/problems/bulls-and-cows "猜数字游戏")
 
 <p>You are playing the following <a href="https://en.wikipedia.org/wiki/Bulls_and_Cows" target="_blank">Bulls and Cows</a> game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint that indicates how many digits in said guess match your secret number exactly in both digit and position (called &quot;bulls&quot;) and how many digits match the secret number but locate in the wrong position (called &quot;cows&quot;). Your friend will use successive guesses and hints to eventually derive the secret number.</p>
 

problems/corporate-flight-bookings/README.md

@@ -33,3 +33,7 @@
 	<li><code>1 &lt;= bookings[i][0] &lt;= bookings[i][1] &lt;= n &lt;= 20000</code></li>
 	<li><code>1 &lt;= bookings[i][2] &lt;= 10000</code></li>
 </ul>
+
+### Related Topics
+  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
+  [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]

problems/count-vowels-permutation/README.md

@@ -9,7 +9,7 @@
 
 Next >
 
-## [5216. Count Vowels Permutation (Hard)](https://leetcode.com/problems/count-vowels-permutation "统计元音字母序列的数目")
+## [1220. Count Vowels Permutation (Hard)](https://leetcode.com/problems/count-vowels-permutation "统计元音字母序列的数目")
 
 <p>Given an integer <code>n</code>, your task is to count how many strings of length <code>n</code> can be formed under the following rules:</p>
 
@@ -54,6 +54,9 @@ Next >
 	<li><code>1 &lt;= n &lt;= 2 * 10^4</code></li>
 </ul>
 
+### Related Topics
+  [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]
+
 ### Hints
 <details>
 <summary>Hint 1</summary>

problems/critical-connections-in-a-network/README.md

@@ -38,6 +38,9 @@
 	<li>There are no repeated connections.</li>
 </ul>
 
+### Related Topics
+  [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]
+
 ### Hints
 <details>
 <summary>Hint 1</summary>

problems/data-stream-as-disjoint-intervals/README.md

@@ -23,10 +23,11 @@
 [1, 3], [6, 7]
 </pre>
 
-<p><b>Follow up:</b><br />
-What if there are lots of merges and the number of disjoint intervals are small compared to the data stream&#39;s size?</p>
+<p>&nbsp;</p>
 
-<p><strong>NOTE:</strong>&nbsp;input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.</p>
+<p><b>Follow up:</b></p>
+
+<p>What if there are lots of merges and the number of disjoint intervals are small compared to the data stream&#39;s size?</p>
 
 ### Related Topics
   [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]

problems/day-of-the-week/README.md

@@ -46,6 +46,9 @@
 	<li>The given dates are valid&nbsp;dates between the years <code>1971</code> and <code>2100</code>.</li>
 </ul>
 
+### Related Topics
+  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
+
 ### Hints
 <details>
 <summary>Hint 1</summary>

problems/day-of-the-year/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-dice-rolls-with-target-sum "Number of Dice Rolls With Target Sum")
 
-## [1154. Day of the Year (Easy)](https://leetcode.com/problems/day-of-the-year "")
+## [1154. Day of the Year (Easy)](https://leetcode.com/problems/day-of-the-year "一年中的第几天")
 
 <p>Given a string <code>date</code> representing a <a href="https://en.wikipedia.org/wiki/Gregorian_calendar" target="_blank">Gregorian&nbsp;calendar</a> date formatted as <code>YYYY-MM-DD</code>, return the day number of the year.</p>
 

problems/decrease-elements-to-make-array-zigzag/README.md

@@ -48,3 +48,9 @@
 
 ### Related Topics
   [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+Do each case (even indexed is greater, odd indexed is greater) separately. In say the even case, you should decrease each even-indexed element until it is lower than its immediate neighbors.
+</details>

problems/defanging-an-ip-address/README.md

@@ -29,3 +29,6 @@
 <ul>
 	<li>The given <code>address</code> is a valid IPv4 address.</li>
 </ul>
+
+### Related Topics
+  [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]

problems/delete-nodes-and-return-forest/README.md

@@ -36,3 +36,7 @@
 	<li><code>to_delete.length &lt;= 1000</code></li>
 	<li><code>to_delete</code> contains distinct values between <code>1</code> and <code>1000</code>.</li>
 </ul>
+
+### Related Topics
+  [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]
+  [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]

problems/distance-between-bus-stops/README.md

@@ -61,6 +61,9 @@
 	<li><code>0 &lt;= distance[i] &lt;= 10^4</code></li>
 </ul>
 
+### Related Topics
+  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
+
 ### Hints
 <details>
 <summary>Hint 1</summary>

problems/find-all-anagrams-in-a-string/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser "Ternary Expression Parser")
 
-## [438. Find All Anagrams in a String (Easy)](https://leetcode.com/problems/find-all-anagrams-in-a-string "找到字符串中所有字母异位词")
+## [438. Find All Anagrams in a String (Medium)](https://leetcode.com/problems/find-all-anagrams-in-a-string "找到字符串中所有字母异位词")
 
 <p>Given a string <b>s</b> and a <b>non-empty</b> string <b>p</b>, find all the start indices of <b>p</b>'s anagrams in <b>s</b>.</p>
 

problems/get-equal-substrings-within-budget/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/remove-all-adjacent-duplicates-in-string-ii "Remove All Adjacent Duplicates in String II")
 
-## [5207. Get Equal Substrings Within Budget (Medium)](https://leetcode.com/problems/get-equal-substrings-within-budget "尽可能使字符串相等")
+## [1208. Get Equal Substrings Within Budget (Medium)](https://leetcode.com/problems/get-equal-substrings-within-budget "尽可能使字符串相等")
 
 <p>You are given two strings <code>s</code> and <code>t</code> of the same length. You want to change <code>s</code> to <code>t</code>. Changing the <code>i</code>-th character of <code>s</code> to <code>i</code>-th character of <code>t</code> costs <code>|s[i] - t[i]|</code> that is, the absolute difference between the ASCII values of the characters.</p>
 
@@ -23,22 +23,22 @@
 <p><strong>Example 1:</strong></p>
 
 <pre>
-<strong>Input:</strong> s = &quot;abcd&quot;, t = &quot;bcdf&quot;, cost = 3
+<strong>Input:</strong> s = &quot;abcd&quot;, t = &quot;bcdf&quot;, maxCost = 3
 <strong>Output:</strong> 3
 <strong>Explanation: </strong>&quot;abc&quot; of s can change to &quot;bcd&quot;. That costs 3, so the maximum length is 3.</pre>
 
 <p><strong>Example 2:</strong></p>
 
 <pre>
-<strong>Input:</strong> s = &quot;abcd&quot;, t = &quot;cdef&quot;, cost = 3
+<strong>Input:</strong> s = &quot;abcd&quot;, t = &quot;cdef&quot;, maxCost = 3
 <strong>Output:</strong> 1
-<strong>Explanation: </strong>Each charactor in s costs 2 to change to charactor in <code>t, so the maximum length is 1.</code>
+<strong>Explanation: </strong>Each character in s costs 2 to change to charactor in <code>t, so the maximum length is 1.</code>
 </pre>
 
 <p><strong>Example 3:</strong></p>
 
 <pre>
-<strong>Input:</strong> s = &quot;abcd&quot;, t = &quot;acde&quot;, cost = 0
+<strong>Input:</strong> s = &quot;abcd&quot;, t = &quot;acde&quot;, maxCost = 0
 <strong>Output:</strong> 1
 <strong>Explanation: </strong>You can&#39;t make any change, so the maximum length is 1.
 </pre>
@@ -52,6 +52,10 @@
 	<li><code>s</code> and&nbsp;<code>t</code> only contain lower case English letters.</li>
 </ul>
 
+### Related Topics
+  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
+  [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)]
+
 ### Hints
 <details>
 <summary>Hint 1</summary>

problems/increasing-subsequences/README.md

@@ -11,24 +11,26 @@
 
 ## [491. Increasing Subsequences (Medium)](https://leetcode.com/problems/increasing-subsequences "递增子序列")
 
-<p>
-Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2 .
-</p>
+<p>Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2.</p>
+
+<p>&nbsp;</p>
+
+<p><b>Example:</b></p>
 
-<p><b>Example:</b><br />
 <pre>
 <b>Input:</b> [4, 6, 7, 7]
 <b>Output:</b> [[4, 6], [4, 7], [4, 6, 7], [4, 6, 7, 7], [6, 7], [6, 7, 7], [7,7], [4,7,7]]
 </pre>
-</p>
 
-<p><b>Note:</b><br>
+<p>&nbsp;</p>
+
+<p><b>Note:</b></p>
+
 <ol>
-<li>The length of the given array will not exceed 15.</li>
-<li>The range of integer in the given array is [-100,100].</li>
-<li>The given array may contain duplicates, and two equal integers should also be considered as a special case of increasing sequence.</li>
+	<li>The length of the given array will not exceed 15.</li>
+	<li>The range of integer in the given array is [-100,100].</li>
+	<li>The given array may contain duplicates, and two equal integers should also be considered as a special case of increasing sequence.</li>
 </ol>
-</p>
 
 ### Related Topics
   [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]

problems/intersection-of-three-sorted-arrays/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/two-sum-bsts "Two Sum BSTs")
 
-## [5079. Intersection of Three Sorted Arrays (Easy)](https://leetcode.com/problems/intersection-of-three-sorted-arrays "三个有序数组的交集")
+## [1213. Intersection of Three Sorted Arrays (Easy)](https://leetcode.com/problems/intersection-of-three-sorted-arrays "三个有序数组的交集")
 
 <p>Given three integer arrays <code>arr1</code>, <code>arr2</code> and <code>arr3</code>&nbsp;<strong>sorted</strong> in <strong>strictly increasing</strong> order, return a sorted array of <strong>only</strong>&nbsp;the&nbsp;integers that appeared in <strong>all</strong> three arrays.</p>