Merge pull request #688 from openset/develop

Add: new

Author: Shuo

README.md

@@ -62,6 +62,10 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
+| <span id="1224">1224</span> | [Maximum Equal Frequency](https://leetcode.com/problems/maximum-equal-frequency "最大相等频率") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-equal-frequency) | Hard |
+| <span id="1223">1223</span> | [Dice Roll Simulation](https://leetcode.com/problems/dice-roll-simulation "掷骰子模拟") | [Go](https://github.com/openset/leetcode/tree/master/problems/dice-roll-simulation) | Medium |
+| <span id="1222">1222</span> | [Queens That Can Attack the King](https://leetcode.com/problems/queens-that-can-attack-the-king "可以攻击国王的皇后") | [Go](https://github.com/openset/leetcode/tree/master/problems/queens-that-can-attack-the-king) | Medium |
+| <span id="1221">1221</span> | [Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings "分割平衡字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/split-a-string-in-balanced-strings) | Easy |
 | <span id="1220">1220</span> | [Count Vowels Permutation](https://leetcode.com/problems/count-vowels-permutation "统计元音字母序列的数目") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-vowels-permutation) | Hard |
 | <span id="1219">1219</span> | [Path with Maximum Gold](https://leetcode.com/problems/path-with-maximum-gold "黄金矿工") | [Go](https://github.com/openset/leetcode/tree/master/problems/path-with-maximum-gold) | Medium |
 | <span id="1218">1218</span> | [Longest Arithmetic Subsequence of Given Difference](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference "最长定差子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/longest-arithmetic-subsequence-of-given-difference) | Medium |

problems/count-vowels-permutation/README.md

@@ -7,7 +7,7 @@
 
 [< Previous](https://github.com/openset/leetcode/tree/master/problems/path-with-maximum-gold "Path with Maximum Gold")
 
-Next >
+[Next >](https://github.com/openset/leetcode/tree/master/problems/split-a-string-in-balanced-strings "Split a String in Balanced Strings")
 
 ## [1220. Count Vowels Permutation (Hard)](https://leetcode.com/problems/count-vowels-permutation "统计元音字母序列的数目")
 

problems/dice-roll-simulation/README.md

@@ -0,0 +1,64 @@
+<!--|This file generated by command(leetcode description); DO NOT EDIT.    |-->
+<!--+----------------------------------------------------------------------+-->
+<!--|@author    openset <[email protected]>                           |-->
+<!--|@link      https://github.com/openset                                 |-->
+<!--|@home      https://github.com/openset/leetcode                        |-->
+<!--+----------------------------------------------------------------------+-->
+
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/queens-that-can-attack-the-king "Queens That Can Attack the King")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-equal-frequency "Maximum Equal Frequency")
+
+## [1223. Dice Roll Simulation (Medium)](https://leetcode.com/problems/dice-roll-simulation "掷骰子模拟")
+
+<p>A die simulator generates a random number from 1 to 6 for each roll.&nbsp;You introduced a constraint to the generator such that it cannot roll the number <code>i</code> more than <code>rollMax[i]</code> (1-indexed) <strong>consecutive</strong> times.&nbsp;</p>
+
+<p>Given an array of integers&nbsp;<code>rollMax</code>&nbsp;and an integer&nbsp;<code>n</code>, return the number of distinct sequences that can be obtained with exact <code>n</code> rolls.</p>
+
+<p>Two sequences are considered different if at least one element differs from each other. Since the answer&nbsp;may be too large,&nbsp;return it modulo <code>10^9 + 7</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> n = 2, rollMax = [1,1,2,2,2,3]
+<strong>Output:</strong> 34
+<strong>Explanation:</strong> There will be 2 rolls of die, if there are no constraints on the die, there are 6 * 6 = 36 possible combinations. In this case, looking at rollMax array, the numbers 1 and 2 appear at most once consecutively, therefore sequences (1,1) and (2,2) cannot occur, so the final answer is 36-2 = 34.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> n = 2, rollMax = [1,1,1,1,1,1]
+<strong>Output:</strong> 30
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> n = 3, rollMax = [1,1,1,2,2,3]
+<strong>Output:</strong> 181
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= 5000</code></li>
+	<li><code>rollMax.length == 6</code></li>
+	<li><code>1 &lt;= rollMax[i] &lt;= 15</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>
+Think on Dynamic Programming.
+</details>
+
+<details>
+<summary>Hint 2</summary>
+DP(pos, last) which means we are at the position pos having as last the last character seen.
+</details>

problems/find-smallest-common-element-in-all-rows/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-time-to-build-blocks "Minimum Time to Build Blocks")
 
-## [1198. Find Smallest Common Element in All Rows (Medium)](https://leetcode.com/problems/find-smallest-common-element-in-all-rows "")
+## [1198. Find Smallest Common Element in All Rows (Medium)](https://leetcode.com/problems/find-smallest-common-element-in-all-rows "找出所有行中最小公共元素")
 
 
 

problems/how-many-apples-can-you-put-into-the-basket/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-knight-moves "Minimum Knight Moves")
 
-## [1196. How Many Apples Can You Put into the Basket (Easy)](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket "")
+## [1196. How Many Apples Can You Put into the Basket (Easy)](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket "最多可以买到的苹果数量")
 
 
 

problems/maximum-equal-frequency/README.md

@@ -0,0 +1,68 @@
+<!--|This file generated by command(leetcode description); DO NOT EDIT.    |-->
+<!--+----------------------------------------------------------------------+-->
+<!--|@author    openset <[email protected]>                           |-->
+<!--|@link      https://github.com/openset                                 |-->
+<!--|@home      https://github.com/openset/leetcode                        |-->
+<!--+----------------------------------------------------------------------+-->
+
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/dice-roll-simulation "Dice Roll Simulation")
+　　　　　　　　　　　　　　　　
+Next >
+
+## [1224. Maximum Equal Frequency (Hard)](https://leetcode.com/problems/maximum-equal-frequency "最大相等频率")
+
+<p>Given an array <code>nums</code>&nbsp;of positive integers, return the longest possible length of an array prefix of <code>nums</code>, such that it is possible to remove <strong>exactly one</strong> element from this prefix so that every number that has appeared in it will have the same number of occurrences.</p>
+
+<p>If after removing one element there are no remaining elements, it&#39;s still considered that every appeared number has the same number of ocurrences (0).</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [2,2,1,1,5,3,3,5]
+<strong>Output:</strong> 7
+<strong>Explanation:</strong> For the subarray [2,2,1,1,5,3,3] of length 7, if we remove nums[4]=5, we will get [2,2,1,1,3,3], so that each number will appear exactly twice.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,1,1,2,2,2,3,3,3,4,4,4,5]
+<strong>Output:</strong> 13
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,1,1,2,2,2]
+<strong>Output:</strong> 5
+</pre>
+
+<p><strong>Example 4:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [10,2,8,9,3,8,1,5,2,3,7,6]
+<strong>Output:</strong> 8
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>2 &lt;= nums.length &lt;= 10^5</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10^5</code></li>
+</ul>
+
+### Related Topics
+  [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+Keep track of the min and max frequencies.
+</details>
+
+<details>
+<summary>Hint 2</summary>
+The number to be eliminated must have a frequency of 1, same as the others or the same +1.
+</details>

problems/minimum-absolute-difference/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/ugly-number-iii "Ugly Number III")
 
-## [1200. Minimum Absolute Difference (Easy)](https://leetcode.com/problems/minimum-absolute-difference "")
+## [1200. Minimum Absolute Difference (Easy)](https://leetcode.com/problems/minimum-absolute-difference "最小绝对差")
 
 <p>Given an&nbsp;array&nbsp;of <strong>distinct</strong>&nbsp;integers <code>arr</code>, find all pairs of elements with the minimum absolute difference of any two elements.&nbsp;</p>
 

problems/minimum-knight-moves/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/find-smallest-common-element-in-all-rows "Find Smallest Common Element in All Rows")
 
-## [1197. Minimum Knight Moves (Medium)](https://leetcode.com/problems/minimum-knight-moves "")
+## [1197. Minimum Knight Moves (Medium)](https://leetcode.com/problems/minimum-knight-moves "进击的骑士")
 
 
 

problems/minimum-time-to-build-blocks/README.md

@@ -9,7 +9,7 @@
 
 [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference "Minimum Absolute Difference")
 
-## [1199. Minimum Time to Build Blocks (Hard)](https://leetcode.com/problems/minimum-time-to-build-blocks "")
+## [1199. Minimum Time to Build Blocks (Hard)](https://leetcode.com/problems/minimum-time-to-build-blocks "建造街区的最短时间")
 
 
 

problems/queens-that-can-attack-the-king/README.md

@@ -0,0 +1,77 @@
+<!--|This file generated by command(leetcode description); DO NOT EDIT.    |-->
+<!--+----------------------------------------------------------------------+-->
+<!--|@author    openset <[email protected]>                           |-->
+<!--|@link      https://github.com/openset                                 |-->
+<!--|@home      https://github.com/openset/leetcode                        |-->
+<!--+----------------------------------------------------------------------+-->
+
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/split-a-string-in-balanced-strings "Split a String in Balanced Strings")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/dice-roll-simulation "Dice Roll Simulation")
+
+## [1222. Queens That Can Attack the King (Medium)](https://leetcode.com/problems/queens-that-can-attack-the-king "可以攻击国王的皇后")
+
+<p>On an <strong>8x8</strong> chessboard, there can be multiple Black Queens and one White King.</p>
+
+<p>Given an array of integer coordinates <code>queens</code> that represents the positions of the Black Queens, and a pair of coordinates <code>king</code> that represent the position of the White King, return the coordinates of all the queens (in any order) that can attack the King.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<p><img alt="" src="https://assets.leetcode.com/uploads/2019/10/01/untitled-diagram.jpg" style="width: 321px; height: 321px;" /></p>
+
+<pre>
+<strong>Input:</strong> queens = [[0,1],[1,0],[4,0],[0,4],[3,3],[2,4]], king = [0,0]
+<strong>Output:</strong> [[0,1],[1,0],[3,3]]
+<strong>Explanation:</strong>&nbsp; 
+The queen at [0,1] can attack the king cause they&#39;re in the same row. 
+The queen at [1,0] can attack the king cause they&#39;re in the same column. 
+The queen at [3,3] can attack the king cause they&#39;re in the same diagnal. 
+The queen at [0,4] can&#39;t attack the king cause it&#39;s blocked by the queen at [0,1]. 
+The queen at [4,0] can&#39;t attack the king cause it&#39;s blocked by the queen at [1,0]. 
+The queen at [2,4] can&#39;t attack the king cause it&#39;s not in the same row/column/diagnal as the king.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/10/01/untitled-diagram-1.jpg" style="width: 321px; height: 321px;" /></strong></p>
+
+<pre>
+<strong>Input:</strong> queens = [[0,0],[1,1],[2,2],[3,4],[3,5],[4,4],[4,5]], king = [3,3]
+<strong>Output:</strong> [[2,2],[3,4],[4,4]]
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/10/01/untitled-diagram-2.jpg" style="width: 321px; height: 321px;" /></strong></p>
+
+<pre>
+<strong>Input:</strong> queens = [[5,6],[7,7],[2,1],[0,7],[1,6],[5,1],[3,7],[0,3],[4,0],[1,2],[6,3],[5,0],[0,4],[2,2],[1,1],[6,4],[5,4],[0,0],[2,6],[4,5],[5,2],[1,4],[7,5],[2,3],[0,5],[4,2],[1,0],[2,7],[0,1],[4,6],[6,1],[0,6],[4,3],[1,7]], king = [3,4]
+<strong>Output:</strong> [[2,3],[1,4],[1,6],[3,7],[4,3],[5,4],[4,5]]
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= queens.length&nbsp;&lt;= 63</code></li>
+	<li><code>queens[0].length == 2</code></li>
+	<li><code>0 &lt;= queens[i][j] &lt;&nbsp;8</code></li>
+	<li><code>king.length == 2</code></li>
+	<li><code>0 &lt;= king[0], king[1] &lt; 8</code></li>
+	<li>At most one piece is allowed in a cell.</li>
+</ul>
+
+### Related Topics
+  [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+Check 8 directions around the King.
+</details>
+
+<details>
+<summary>Hint 2</summary>
+Find the nearest queen in each direction.
+</details>