Merge pull request #716 from openset/develop

Add: new

Author: Shuo

README.md

@@ -62,6 +62,14 @@ LeetCode Problems' Solutions
 
 | # | Title | Solution | Difficulty |
 | :-: | - | - | :-: |
+| <span id="1263">1263</span> | [Minimum Moves to Move a Box to Their Target Location](https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location "推箱子") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-move-a-box-to-their-target-location) | Hard |
+| <span id="1262">1262</span> | [Greatest Sum Divisible by Three](https://leetcode.com/problems/greatest-sum-divisible-by-three "可被三整除的最大和") | [Go](https://github.com/openset/leetcode/tree/master/problems/greatest-sum-divisible-by-three) | Medium |
+| <span id="1261">1261</span> | [Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree "在受污染的二叉树中查找元素") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-elements-in-a-contaminated-binary-tree) | Medium |
+| <span id="1260">1260</span> | [Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid "二维网格迁移") | [Go](https://github.com/openset/leetcode/tree/master/problems/shift-2d-grid) | Easy |
+| <span id="1259">1259</span> | [Handshakes That Don't Cross](https://leetcode.com/problems/handshakes-that-dont-cross "不相交的握手") | [Go](https://github.com/openset/leetcode/tree/master/problems/handshakes-that-dont-cross) | Hard |
+| <span id="1258">1258</span> | [Synonymous Sentences](https://leetcode.com/problems/synonymous-sentences "近义词句子") | [Go](https://github.com/openset/leetcode/tree/master/problems/synonymous-sentences) | Medium |
+| <span id="1257">1257</span> | [Smallest Common Region](https://leetcode.com/problems/smallest-common-region "最小公共区域") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-common-region) | Medium |
+| <span id="1256">1256</span> | [Encode Number](https://leetcode.com/problems/encode-number "加密数字") | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-number) | Medium |
 | <span id="1255">1255</span> | [Maximum Score Words Formed by Letters](https://leetcode.com/problems/maximum-score-words-formed-by-letters "得分最高的单词集合") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-score-words-formed-by-letters) | Hard |
 | <span id="1254">1254</span> | [Number of Closed Islands](https://leetcode.com/problems/number-of-closed-islands "统计封闭岛屿的数目") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-closed-islands) | Medium |
 | <span id="1253">1253</span> | [Reconstruct a 2-Row Binary Matrix](https://leetcode.com/problems/reconstruct-a-2-row-binary-matrix "重构 2 行二进制矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/reconstruct-a-2-row-binary-matrix) | Medium |

internal/leetcode/base.go

@@ -22,6 +22,7 @@ var (
 	jsonIndent      = base.JSONIndent
 	LockStr         = " 🔒"
 	translationSet  = make(map[int]string)
+	titleSlugID     = make(map[string]int)
 )
 
 // Clean - leetcode.Clean

internal/leetcode/problems_all.go

@@ -107,3 +107,10 @@ func ProblemsAll() (ps ProblemsType) {
 	})
 	return
 }
+
+func init() {
+	questions := ProblemsAll().StatStatusPairs
+	for _, item := range questions {
+		titleSlugID[item.Stat.QuestionTitleSlug] = item.Stat.FrontendQuestionID
+	}
+}

internal/leetcode/question_data.go

@@ -127,8 +127,8 @@ func (question *questionType) getDescContent() []byte {
 	var buf bytes.Buffer
 	buf.WriteString(authInfo("description"))
 	buf.WriteString(question.getNavigation())
-	buf.WriteString(fmt.Sprintf("\n## [%s. %s%s](%s \"%s\")\n\n",
-		question.QuestionFrontendID,
+	buf.WriteString(fmt.Sprintf("\n## [%d. %s%s](%s \"%s\")\n\n",
+		question.FrontendID(),
 		question.Title,
 		question.Difficulty.Str(),
 		question.LeetCodeURL(),
@@ -152,6 +152,15 @@ func (question *questionType) questionID() int {
 	return id
 }
 
+func (question *questionType) FrontendID() int {
+	id := titleSlugID[question.TitleSlug]
+	if id != 0 {
+		return id
+	}
+	id, _ = strconv.Atoi(question.QuestionFrontendID)
+	return id
+}
+
 func (question *questionType) translatedTitle() string {
 	if question.TranslatedTitle == "" {
 		question.TranslatedTitle = translationSet[question.questionID()]

internal/leetcode/topic_tag.go

@@ -30,21 +30,19 @@ type TagType struct {
 func (tag *TagType) SaveContents() {
 	questions := GetTopicTag(tag.Slug).Data.TopicTag.Questions
 	sort.Slice(questions, func(i, j int) bool {
-		m, _ := strconv.Atoi(questions[i].QuestionFrontendID)
-		n, _ := strconv.Atoi(questions[j].QuestionFrontendID)
-		return m > n
+		return questions[i].frontendID() > questions[j].frontendID()
 	})
 	var buf bytes.Buffer
 	buf.WriteString(authInfo("tag"))
 	buf.WriteString(fmt.Sprintf("\n## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > %s\n\n", tag.name()))
 	buf.WriteString("| # | 题名 | 标签 | 难度 |\n")
 	buf.WriteString("| :-: | - | - | :-: |\n")
-	format := "| %s | [%s](https://github.com/openset/leetcode/tree/master/problems/%s)%s | %s | %s |\n"
+	format := "| %d | [%s](https://github.com/openset/leetcode/tree/master/problems/%s)%s | %s | %s |\n"
 	for _, question := range questions {
 		if question.TranslatedTitle == "" {
 			question.TranslatedTitle = question.Title
 		}
-		buf.WriteString(fmt.Sprintf(format, question.QuestionFrontendID, question.TranslatedTitle, question.TitleSlug, question.IsPaidOnly.Str(), question.TagsStr(), question.Difficulty))
+		buf.WriteString(fmt.Sprintf(format, question.frontendID(), question.TranslatedTitle, question.TitleSlug, question.IsPaidOnly.Str(), question.TagsStr(), question.Difficulty))
 	}
 	filename := filepath.Join("tag", tag.Slug, "README.md")
 	filePutContents(filename, buf.Bytes())
@@ -95,6 +93,15 @@ func (question *ttQuestionType) TagsStr() string {
 	return buf.String()
 }
 
+func (question *ttQuestionType) frontendID() int {
+	id := titleSlugID[question.TitleSlug]
+	if id != 0 {
+		return id
+	}
+	id, _ = strconv.Atoi(question.QuestionFrontendID)
+	return id
+}
+
 // GetTags - leetcode.GetTags
 func GetTags() (tags []TagType) {
 	cts := fileGetContents(tagsFile)

internal/post/post.go

@@ -79,7 +79,7 @@ func runPost(cmd *base.Command, args []string) {
 				strings.Join(tags, ", "),
 				question.TitleSlug,
 			))
-			buf.WriteString(fmt.Sprintf("\n## %s. %s%s\n\n", question.QuestionFrontendID, question.TranslatedTitle, question.Difficulty.Str()))
+			buf.WriteString(fmt.Sprintf("\n## %d. %s%s\n\n", question.FrontendID(), question.TranslatedTitle, question.Difficulty.Str()))
 			buf.WriteString("{% raw %}\n\n")
 			content := strings.ReplaceAll(question.TranslatedContent, "\r", "")
 			// remove style

problems/convert-to-base-2/README.md

@@ -58,6 +58,9 @@
 ### Related Topics
   [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]
 
+### Similar Questions
+  1. [Encode Number](https://github.com/openset/leetcode/tree/master/problems/encode-number) (Medium)
+
 ### Hints
 <details>
 <summary>Hint 1</summary>

problems/encode-number/README.md

@@ -0,0 +1,58 @@
+<!--|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/maximum-score-words-formed-by-letters "Maximum Score Words Formed by Letters")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-common-region "Smallest Common Region")
+
+## [1256. Encode Number (Medium)](https://leetcode.com/problems/encode-number "加密数字")
+
+<p>Given a non-negative integer <code>num</code>, Return its <em>encoding</em> string.</p>
+
+<p>The encoding is done by converting the integer to a string using a secret function that you should deduce from the following table:</p>
+
+<p><img alt="" src="https://assets.leetcode.com/uploads/2019/06/21/encode_number.png" style="width: 164px; height: 360px;" /></p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> num = 23
+<strong>Output:</strong> &quot;1000&quot;
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> num = 107
+<strong>Output:</strong> &quot;101100&quot;
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>0 &lt;= num &lt;= 10^9</code></li>
+</ul>
+
+### Related Topics
+  [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]
+  [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]
+
+### Similar Questions
+  1. [Convert to Base -2](https://github.com/openset/leetcode/tree/master/problems/convert-to-base-2) (Medium)
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+Try to find the number of binary digits returned by the function.
+</details>
+
+<details>
+<summary>Hint 2</summary>
+The pattern is to start counting from zero after determining the number of binary digits.
+</details>

problems/find-elements-in-a-contaminated-binary-tree/README.md

@@ -0,0 +1,105 @@
+<!--|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/shift-2d-grid "Shift 2D Grid")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/greatest-sum-divisible-by-three "Greatest Sum Divisible by Three")
+
+## [1261. Find Elements in a Contaminated Binary Tree (Medium)](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree "在受污染的二叉树中查找元素")
+
+<p>Given a&nbsp;binary tree with the following rules:</p>
+
+<ol>
+	<li><code>root.val == 0</code></li>
+	<li>If <code>treeNode.val == x</code> and <code>treeNode.left != null</code>, then <code>treeNode.left.val == 2 * x + 1</code></li>
+	<li>If <code>treeNode.val == x</code> and <code>treeNode.right != null</code>, then <code>treeNode.right.val == 2 * x + 2</code></li>
+</ol>
+
+<p>Now the binary tree is contaminated, which means all&nbsp;<code>treeNode.val</code>&nbsp;have&nbsp;been changed to <code>-1</code>.</p>
+
+<p>You need to first recover the binary tree and then implement the <code>FindElements</code> class:</p>
+
+<ul>
+	<li><code>FindElements(TreeNode* root)</code>&nbsp;Initializes the object with a&nbsp;contamined binary tree, you need to recover it first.</li>
+	<li><code>bool find(int target)</code>&nbsp;Return if the <code>target</code> value exists in the recovered binary tree.</li>
+</ul>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/11/06/untitled-diagram-4-1.jpg" style="width: 320px; height: 119px;" /></strong></p>
+
+<pre>
+<strong>Input</strong>
+[&quot;FindElements&quot;,&quot;find&quot;,&quot;find&quot;]
+[[[-1,null,-1]],[1],[2]]
+<strong>Output</strong>
+[null,false,true]
+<strong>Explanation</strong>
+FindElements findElements = new FindElements([-1,null,-1]); 
+findElements.find(1); // return False 
+findElements.find(2); // return True </pre>
+
+<p><strong>Example 2:</strong></p>
+
+<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/11/06/untitled-diagram-4.jpg" style="width: 400px; height: 198px;" /></strong></p>
+
+<pre>
+<strong>Input</strong>
+[&quot;FindElements&quot;,&quot;find&quot;,&quot;find&quot;,&quot;find&quot;]
+[[[-1,-1,-1,-1,-1]],[1],[3],[5]]
+<strong>Output</strong>
+[null,true,true,false]
+<strong>Explanation</strong>
+FindElements findElements = new FindElements([-1,-1,-1,-1,-1]);
+findElements.find(1); // return True
+findElements.find(3); // return True
+findElements.find(5); // return False</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/11/07/untitled-diagram-4-1-1.jpg" style="width: 306px; height: 274px;" /></strong></p>
+
+<pre>
+<strong>Input</strong>
+[&quot;FindElements&quot;,&quot;find&quot;,&quot;find&quot;,&quot;find&quot;,&quot;find&quot;]
+[[[-1,null,-1,-1,null,-1]],[2],[3],[4],[5]]
+<strong>Output</strong>
+[null,true,false,false,true]
+<strong>Explanation</strong>
+FindElements findElements = new FindElements([-1,null,-1,-1,null,-1]);
+findElements.find(2); // return True
+findElements.find(3); // return False
+findElements.find(4); // return False
+findElements.find(5); // return True
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>TreeNode.val == -1</code></li>
+	<li>The height of the binary tree is less than or equal to <code>20</code></li>
+	<li>The total number of nodes is between <code>[1,&nbsp;10^4]</code></li>
+	<li>Total calls of <code>find()</code> is between <code>[1,&nbsp;10^4]</code></li>
+	<li><code>0 &lt;= target &lt;= 10^6</code></li>
+</ul>
+
+### Related Topics
+  [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]
+  [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]
+
+### Hints
+<details>
+<summary>Hint 1</summary>
+Use DFS to traverse the binary tree and recover it.
+</details>
+
+<details>
+<summary>Hint 2</summary>
+Use a hashset to store TreeNode.val for finding.
+</details>

problems/friend-requests-ii-who-has-the-most-friends/README.md

@@ -11,40 +11,48 @@
 
 ## [602. Friend Requests II: Who Has the Most Friends (Medium)](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends "好友申请 II ：谁有最多的好友")
 
-In social network like Facebook or Twitter, people send friend requests and accept others' requests as well.
-<p>&nbsp;</p>
-Table <code>request_accepted</code> holds the data of friend acceptance, while <b>requester_id</b> and <b>accepter_id</b> both are the id of a person.
+<p>In social network like Facebook or Twitter, people send friend requests and accept others&#39; requests as well.</p>
 
 <p>&nbsp;</p>
 
+<p>Table <code>request_accepted</code></p>
+
 <pre>
++--------------+-------------+------------+
 | requester_id | accepter_id | accept_date|
 |--------------|-------------|------------|
 | 1            | 2           | 2016_06-03 |
 | 1            | 3           | 2016-06-08 |
 | 2            | 3           | 2016-06-08 |
 | 3            | 4           | 2016-06-09 |
++--------------+-------------+------------+
+This table holds the data of friend acceptance, while <b>requester_id</b> and <b>accepter_id</b> both are the id of a person.
 </pre>
-Write a query to find the the people who has most friends and the most friends number. For the sample data above, the result is:
 
-<pre>
-| id | num |
-|----|-----|
-| 3  | 3   |
-</pre>
-<b>Note:</b>
+<p>&nbsp;</p>
+
+<p>Write a query to find the the people who has most friends and the most friends number under the following rules:</p>
 
 <ul>
 	<li>It is guaranteed there is only 1 people having the most friends.</li>
-	<li>The friend request could only been accepted once, which mean there is no multiple records with the same <b>requester_id</b> and <b>accepter_id</b> value.
-	<p>&nbsp;</p>
-	<b>Explanation:</b><br />
-	The person with id &#39;3&#39; is a friend of people &#39;1&#39;, &#39;2&#39; and &#39;4&#39;, so he has 3 friends in total, which is the most number than any others.
-	<p>&nbsp;</p>
-	<b>Follow-up:</b><br />
-	In the real world, multiple people could have the same most number of friends, can you find all these people in this case?</li>
+	<li>The friend request could only been accepted once, which mean there is no multiple records with the same <b>requester_id</b> and <b>accepter_id</b> value.</li>
 </ul>
 
+<p>For the sample data above, the result is:</p>
+
+<pre>
+Result table:
++------+------+
+| id   | num  |
+|------|------|
+| 3    | 3    |
++------+------+
+The person with id &#39;3&#39; is a friend of people &#39;1&#39;, &#39;2&#39; and &#39;4&#39;, so he has 3 friends in total, which is the most number than any others.
+</pre>
+
+<p><b>Follow-up:</b><br />
+In the real world, multiple people could have the same most number of friends, can you find all these people in this case?</p>
+
 ### Hints
 <details>
 <summary>Hint 1</summary>