Merge pull request #722 from openset/develop

v1.5.1

Author: Shuo

internal/question/question.go

@@ -22,20 +22,22 @@ func runQuestion(cmd *base.Command, args []string) {
 		cmd.Usage()
 		return
 	}
-	if id, err := strconv.Atoi(args[0]); err == nil {
-		problems := leetcode.ProblemsAll()
-		for _, problem := range problems.StatStatusPairs {
-			if problem.Stat.FrontendQuestionID == id {
-				fmt.Println(id, "\t"+problem.Stat.QuestionTitle)
-				titleSlug := problem.Stat.QuestionTitleSlug
-				question := leetcode.QuestionData(titleSlug, true).Data.Question
-				if question.Content == "" && problem.PaidOnly == true && problem.Stat.QuestionArticleLive {
-					question.Content = leetcode.GetDescription(problem.Stat.QuestionArticleSlug)
-				}
-				question.SaveContent()
-				question.SaveCodeSnippet()
-				return
+	id, err := strconv.Atoi(args[0])
+	if err != nil {
+		return
+	}
+	problems := leetcode.ProblemsAll()
+	for _, problem := range problems.StatStatusPairs {
+		if problem.Stat.FrontendQuestionID == id {
+			fmt.Println(id, "\t"+problem.Stat.QuestionTitle)
+			titleSlug := problem.Stat.QuestionTitleSlug
+			question := leetcode.QuestionData(titleSlug, true).Data.Question
+			if question.Content == "" && problem.PaidOnly == true && problem.Stat.QuestionArticleLive {
+				question.Content = leetcode.GetDescription(problem.Stat.QuestionArticleSlug)
 			}
+			question.SaveContent()
+			question.SaveCodeSnippet()
+			return
 		}
 	}
 }

internal/version/version.go

@@ -8,7 +8,7 @@ import (
 	"github.com/openset/leetcode/internal/base"
 )
 
-const version = "1.5.0"
+const version = "1.5.1"
 
 // CmdVersion - version.CmdVersion
 var CmdVersion = &base.Command{

main.go

@@ -49,7 +49,7 @@ func main() {
 		return
 	}
 	args := flag.Args()
-	cmdName := args[0]
+	cmdName := flag.Arg(0)
 	for _, cmd := range base.Commands {
 		if cmd.Name() == cmdName {
 			cmd.Run(cmd, args[1:])

problems/insert-into-a-sorted-circular-linked-list/README.md

@@ -11,7 +11,25 @@
 
 ## [708. Insert into a Sorted Circular Linked List (Medium)](https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list "循环有序列表的插入")
 
+<p>Given a node from a cyclic linked list which is sorted in ascending order, write a function to insert a value into the list such that it remains a cyclic sorted list. The given node can be a reference to <em>any</em> single node in the list, and may not be necessarily the smallest value in the cyclic list.</p>
 
+<p>If there are multiple suitable places for insertion, you may choose any place to insert the new value. After the insertion, the cyclic list should remain sorted.</p>
+
+<p>If the list is empty (i.e., given node is <code>null</code>), you should create a new single cyclic list and return the reference to that single node. Otherwise, you should return the original given node.</p>
+
+<p>The following example may help you understand the problem better:</p>
+
+<p>&nbsp;</p>
+
+<p><img alt="" src="https://assets.leetcode.com/uploads/2019/01/19/example_1_before_65p.jpg" style="width: 250px; height: 149px;" /><br />
+<br />
+<small>In the figure above, there is a cyclic sorted list of three elements. You are given a reference to the node with value 3, and we need to insert 2 into the list.</small></p>
+
+<p>&nbsp;</p>
+
+<p><img alt="" src="https://assets.leetcode.com/uploads/2019/01/19/example_1_after_65p.jpg" style="width: 250px; height: 149px;" /><br />
+<br />
+<small>The new node should insert between node 1 and node 3. After the insertion, the list should look like this, and we should still return node 3.</small></p>
 
 ### Related Topics
   [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)]