awesee
diff --git a/‎internal/base/base.go
+2 b/‎internal/base/base.go
+2
diff --git a/‎internal/leetcode/question_data.go
+14-2 b/‎internal/leetcode/question_data.go
+14-2
diff --git a/‎internal/version/version.go
+1-1 b/‎internal/version/version.go
+1-1
diff --git a/‎problems/01-matrix/01_matrix.go
+1-1 b/‎problems/01-matrix/01_matrix.go
+1-1
diff --git a/‎problems/01-matrix/01_matrix_test.go
+1-1 b/‎problems/01-matrix/01_matrix_test.go
+1-1
diff --git a/‎problems/1-bit-and-2-bit-characters/1_bit_and_2_bit_characters.go
+1-1 b/‎problems/1-bit-and-2-bit-characters/1_bit_and_2_bit_characters.go
+1-1
diff --git a/‎problems/1-bit-and-2-bit-characters/1_bit_and_2_bit_characters_test.go
+1-1 b/‎problems/1-bit-and-2-bit-characters/1_bit_and_2_bit_characters_test.go
+1-1
diff --git a/‎problems/132-pattern/132_pattern.go
+1-1 b/‎problems/132-pattern/132_pattern.go
+1-1
diff --git a/‎problems/132-pattern/132_pattern_test.go
+1-1 b/‎problems/132-pattern/132_pattern_test.go
+1-1
diff --git a/‎problems/2-keys-keyboard/2_keys_keyboard.go
+1-1 b/‎problems/2-keys-keyboard/2_keys_keyboard.go
+1-1
diff --git a/‎problems/2-keys-keyboard/2_keys_keyboard_test.go
+1-1 b/‎problems/2-keys-keyboard/2_keys_keyboard_test.go
+1-1
diff --git a/‎problems/24-game/24_game.go
+1-1 b/‎problems/24-game/24_game.go
+1-1
diff --git a/‎problems/24-game/24_game_test.go
+1-1 b/‎problems/24-game/24_game_test.go
+1-1
diff --git a/‎problems/3sum-closest/3sum_closest.go
+1-1 b/‎problems/3sum-closest/3sum_closest.go
+1-1
diff --git a/‎problems/3sum-closest/3sum_closest_test.go
+1-1 b/‎problems/3sum-closest/3sum_closest_test.go
+1-1
diff --git a/‎problems/3sum-smaller/3sum_smaller.go
+1-1 b/‎problems/3sum-smaller/3sum_smaller.go
+1-1
diff --git a/‎problems/3sum-smaller/3sum_smaller_test.go
+1-1 b/‎problems/3sum-smaller/3sum_smaller_test.go
+1-1
diff --git a/‎problems/3sum-with-multiplicity/3sum_with_multiplicity.go
+1-1 b/‎problems/3sum-with-multiplicity/3sum_with_multiplicity.go
+1-1
diff --git a/‎problems/3sum-with-multiplicity/3sum_with_multiplicity_test.go
+1-1 b/‎problems/3sum-with-multiplicity/3sum_with_multiplicity_test.go
+1-1
diff --git a/‎problems/3sum/3sum.go
+1-1 b/‎problems/3sum/3sum.go
+1-1
diff --git a/‎problems/3sum/3sum_test.go
+1-1 b/‎problems/3sum/3sum_test.go
+1-1
diff --git a/‎problems/4-keys-keyboard/4_keys_keyboard.go
+1-1 b/‎problems/4-keys-keyboard/4_keys_keyboard.go
+1-1
diff --git a/‎problems/4-keys-keyboard/4_keys_keyboard_test.go
+1-1 b/‎problems/4-keys-keyboard/4_keys_keyboard_test.go
+1-1
diff --git a/‎problems/4sum-ii/4sum_ii.go
+1-1 b/‎problems/4sum-ii/4sum_ii.go
+1-1
diff --git a/‎problems/4sum-ii/4sum_ii_test.go
+1-1 b/‎problems/4sum-ii/4sum_ii_test.go
+1-1
diff --git a/‎problems/4sum/4sum.go
+1-1 b/‎problems/4sum/4sum.go
+1-1
diff --git a/‎problems/4sum/4sum_test.go
+1-1 b/‎problems/4sum/4sum_test.go
+1-1
diff --git a/‎problems/accounts-merge/accounts_merge.go
+1-1 b/‎problems/accounts-merge/accounts_merge.go
+1-1
diff --git a/‎problems/accounts-merge/accounts_merge_test.go
+1-1 b/‎problems/accounts-merge/accounts_merge_test.go
+1-1
diff --git a/‎problems/add-and-search-word-data-structure-design/add_and_search_word_data_structure_design.go
+1-1 b/‎problems/add-and-search-word-data-structure-design/add_and_search_word_data_structure_design.go
+1-1
diff --git a/‎problems/add-and-search-word-data-structure-design/add_and_search_word_data_structure_design_test.go
+1-1 b/‎problems/add-and-search-word-data-structure-design/add_and_search_word_data_structure_design_test.go
+1-1
diff --git a/‎problems/add-binary/add_binary.go
+1-1 b/‎problems/add-binary/add_binary.go
+1-1
diff --git a/‎problems/add-binary/add_binary_test.go
+1-1 b/‎problems/add-binary/add_binary_test.go
+1-1
diff --git a/‎problems/add-bold-tag-in-string/add_bold_tag_in_string.go
+1-1 b/‎problems/add-bold-tag-in-string/add_bold_tag_in_string.go
+1-1
diff --git a/‎problems/add-bold-tag-in-string/add_bold_tag_in_string_test.go
+1-1 b/‎problems/add-bold-tag-in-string/add_bold_tag_in_string_test.go
+1-1
diff --git a/‎problems/add-digits/add_digits.go
+1-1 b/‎problems/add-digits/add_digits.go
+1-1
diff --git a/‎problems/add-digits/add_digits_test.go
+1-1 b/‎problems/add-digits/add_digits_test.go
+1-1
diff --git a/‎problems/add-one-row-to-tree/add_one_row_to_tree.go
+1-1 b/‎problems/add-one-row-to-tree/add_one_row_to_tree.go
+1-1
diff --git a/‎problems/add-one-row-to-tree/add_one_row_to_tree_test.go
+1-1 b/‎problems/add-one-row-to-tree/add_one_row_to_tree_test.go
+1-1
diff --git a/‎problems/add-strings/add_strings.go
+1-1 b/‎problems/add-strings/add_strings.go
+1-1
diff --git a/‎problems/add-strings/add_strings_test.go
+1-1 b/‎problems/add-strings/add_strings_test.go
+1-1
diff --git a/‎problems/add-to-array-form-of-integer/add_to_array_form_of_integer.go
+1-1 b/‎problems/add-to-array-form-of-integer/add_to_array_form_of_integer.go
+1-1
diff --git a/‎problems/add-to-array-form-of-integer/add_to_array_form_of_integer_test.go
+1-1 b/‎problems/add-to-array-form-of-integer/add_to_array_form_of_integer_test.go
+1-1
diff --git a/‎problems/add-two-numbers-ii/add_two_numbers_ii.go
+1-1 b/‎problems/add-two-numbers-ii/add_two_numbers_ii.go
+1-1
diff --git a/‎problems/add-two-numbers-ii/add_two_numbers_ii_test.go
+1-1 b/‎problems/add-two-numbers-ii/add_two_numbers_ii_test.go
+1-1
diff --git a/‎problems/add-two-numbers/add_two_numbers.go
+1-1 b/‎problems/add-two-numbers/add_two_numbers.go
+1-1
diff --git a/‎problems/add-two-numbers/add_two_numbers_test.go
+1-1 b/‎problems/add-two-numbers/add_two_numbers_test.go
+1-1
diff --git a/‎problems/adding-two-negabinary-numbers/adding_two_negabinary_numbers.go
+1-1 b/‎problems/adding-two-negabinary-numbers/adding_two_negabinary_numbers.go
+1-1
diff --git a/‎problems/additive-number/additive_number.go
+1-1 b/‎problems/additive-number/additive_number.go
+1-1
diff --git a/‎problems/additive-number/additive_number_test.go
+1-1 b/‎problems/additive-number/additive_number_test.go
+1-1
diff --git a/‎problems/advantage-shuffle/advantage_shuffle.go
+1-1 b/‎problems/advantage-shuffle/advantage_shuffle.go
+1-1
diff --git a/‎problems/advantage-shuffle/advantage_shuffle_test.go
+1-1 b/‎problems/advantage-shuffle/advantage_shuffle_test.go
+1-1
diff --git a/‎problems/alien-dictionary/alien_dictionary.go
+1-1 b/‎problems/alien-dictionary/alien_dictionary.go
+1-1
diff --git a/‎problems/alien-dictionary/alien_dictionary_test.go
+1-1 b/‎problems/alien-dictionary/alien_dictionary_test.go
+1-1
diff --git a/‎problems/all-nodes-distance-k-in-binary-tree/all_nodes_distance_k_in_binary_tree.go
+1-1 b/‎problems/all-nodes-distance-k-in-binary-tree/all_nodes_distance_k_in_binary_tree.go
+1-1
diff --git a/‎problems/all-nodes-distance-k-in-binary-tree/all_nodes_distance_k_in_binary_tree_test.go
+1-1 b/‎problems/all-nodes-distance-k-in-binary-tree/all_nodes_distance_k_in_binary_tree_test.go
+1-1
diff --git a/‎problems/all-oone-data-structure/all_oone_data_structure.go
+1-1 b/‎problems/all-oone-data-structure/all_oone_data_structure.go
+1-1
diff --git a/‎problems/all-oone-data-structure/all_oone_data_structure_test.go
+1-1 b/‎problems/all-oone-data-structure/all_oone_data_structure_test.go
+1-1
diff --git a/‎problems/all-paths-from-source-to-target/all_paths_from_source_to_target.go
+1-1 b/‎problems/all-paths-from-source-to-target/all_paths_from_source_to_target.go
+1-1
diff --git a/‎problems/all-paths-from-source-to-target/all_paths_from_source_to_target_test.go
+1-1 b/‎problems/all-paths-from-source-to-target/all_paths_from_source_to_target_test.go
+1-1
diff --git a/‎problems/all-possible-full-binary-trees/all_possible_full_binary_trees.go
+1-1 b/‎problems/all-possible-full-binary-trees/all_possible_full_binary_trees.go
+1-1
diff --git a/‎problems/all-possible-full-binary-trees/all_possible_full_binary_trees_test.go
+1-1 b/‎problems/all-possible-full-binary-trees/all_possible_full_binary_trees_test.go
+1-1
diff --git a/‎problems/alphabet-board-path/alphabet_board_path.go
+1-1 b/‎problems/alphabet-board-path/alphabet_board_path.go
+1-1
diff --git a/‎problems/ambiguous-coordinates/ambiguous_coordinates.go
+1-1 b/‎problems/ambiguous-coordinates/ambiguous_coordinates.go
+1-1
diff --git a/‎problems/ambiguous-coordinates/ambiguous_coordinates_test.go
+1-1 b/‎problems/ambiguous-coordinates/ambiguous_coordinates_test.go
+1-1
diff --git a/‎problems/android-unlock-patterns/android_unlock_patterns.go
+1-1 b/‎problems/android-unlock-patterns/android_unlock_patterns.go
+1-1
diff --git a/‎problems/android-unlock-patterns/android_unlock_patterns_test.go
+1-1 b/‎problems/android-unlock-patterns/android_unlock_patterns_test.go
+1-1
diff --git a/‎problems/arithmetic-slices-ii-subsequence/arithmetic_slices_ii_subsequence.go
+1-1 b/‎problems/arithmetic-slices-ii-subsequence/arithmetic_slices_ii_subsequence.go
+1-1
diff --git a/‎problems/arithmetic-slices-ii-subsequence/arithmetic_slices_ii_subsequence_test.go
+1-1 b/‎problems/arithmetic-slices-ii-subsequence/arithmetic_slices_ii_subsequence_test.go
+1-1
diff --git a/‎problems/arithmetic-slices/arithmetic_slices.go
+1-1 b/‎problems/arithmetic-slices/arithmetic_slices.go
+1-1
diff --git a/‎problems/arithmetic-slices/arithmetic_slices_test.go
+1-1 b/‎problems/arithmetic-slices/arithmetic_slices_test.go
+1-1
diff --git a/‎problems/arranging-coins/arranging_coins.go
+1-1 b/‎problems/arranging-coins/arranging_coins.go
+1-1
diff --git a/‎problems/arranging-coins/arranging_coins_test.go
+1-1 b/‎problems/arranging-coins/arranging_coins_test.go
+1-1
diff --git a/‎problems/array-nesting/array_nesting.go
+1-1 b/‎problems/array-nesting/array_nesting.go
+1-1
@@ -13,13 +13,15 @@ import (
 	"sync"
 )
 
+// CmdName
 const CmdName = "leetcode"
 
 var (
 	Commands []*Command
 	Mutex    sync.Mutex
 )
 
+// Command
 type Command struct {
 	Run       func(cmd *Command, args []string)
 	UsageLine string
 
@@ -208,7 +208,7 @@ func (question *questionType) LeetCodeUrl() string {
 }
 
 func (question *questionType) PackageName() string {
-	return "problem_" + question.QuestionFrontendId
+	return "problem" + question.QuestionFrontendId
 }
 
 func (question *questionType) SaveCodeSnippet() {
@@ -234,7 +234,7 @@ func (question *questionType) SaveCodeSnippet() {
 	for _, lang := range langSupport {
 		if code, ok := codeSet[lang.slug]; ok {
 			lang.handle(question, code)
-			break
+			return
 		}
 	}
 }
@@ -255,6 +255,18 @@ func (question *questionType) saveMysqlSchemas() {
 	filePutContents(question.getFilePath("mysql_schemas.sql"), buf.Bytes())
 }
 
+func (question *questionType) RenamePackageName() {
+	packageName := fmt.Sprintf("package %s", question.PackageName())
+	reg := regexp.MustCompile(`package \w+`)
+	for _, ext := range [...]string{".go", "_test.go"} {
+		cts := fileGetContents(question.getFilePath(question.TitleSnake() + ext))
+		if len(cts) > 0 {
+			content := reg.ReplaceAllString(string(cts), packageName)
+			question.saveCodeContent(content, ext)
+		}
+	}
+}
+
 func handleCodeGolang(question *questionType, code codeSnippetsType) {
 	content := fmt.Sprintf("package %s\n\n", question.PackageName())
 	content += code.Code + "\n"
 
@@ -8,7 +8,7 @@ import (
 	"github.com/openset/leetcode/internal/base"
 )
 
-const version = "1.4.8"
+const version = "1.4.9"
 
 var CmdVersion = &base.Command{
 	Run:       runVersion,
 
@@ -1,4 +1,4 @@
-package problem_542
+package problem542
 
 func updateMatrix(matrix [][]int) [][]int {
 	m, n := len(matrix), len(matrix[0])
 
@@ -1,4 +1,4 @@
-package problem_542
+package problem542
 
 import (
 	"reflect"
 
@@ -1,4 +1,4 @@
-package problem_717
+package problem717
 
 func isOneBitCharacter(bits []int) bool {
 	i, l := 0, len(bits)-1
 
@@ -1,4 +1,4 @@
-package problem_717
+package problem717
 
 import "testing"
 
 
@@ -1,4 +1,4 @@
-package problem_456
+package problem456
 
 func find132pattern(nums []int) bool {
 	ak, ajStack := -1<<31, make([]int, 0, len(nums))
 
@@ -1,4 +1,4 @@
-package problem_456
+package problem456
 
 import "testing"
 
 
@@ -1,4 +1,4 @@
-package problem_650
+package problem650
 
 func minSteps(n int) int {
 	if n == 1 {
 
@@ -1,4 +1,4 @@
-package problem_650
+package problem650
 
 import "testing"
 
 
@@ -1,4 +1,4 @@
-package problem_679
+package problem679
 
 import "sort"
 
 
@@ -1,4 +1,4 @@
-package problem_679
+package problem679
 
 import "testing"
 
 
@@ -1,4 +1,4 @@
-package problem_16
+package problem16
 
 import (
 	"math"
 
@@ -1,4 +1,4 @@
-package problem_16
+package problem16
 
 import "testing"
 
 
@@ -1 +1 @@
-package problem_258
+package problem259
@@ -1 +1 @@
-package problem_258
+package problem259
@@ -1 +1 @@
-package problem_923
+package problem923
@@ -1 +1 @@
-package problem_923
+package problem923
@@ -1,4 +1,4 @@
-package problem_15
+package problem15
 
 import "sort"
 
 
@@ -1,4 +1,4 @@
-package problem_15
+package problem15
 
 import (
 	"reflect"
 
@@ -1 +1 @@
-package problem_651
+package problem651
@@ -1 +1 @@
-package problem_651
+package problem651
@@ -1,4 +1,4 @@
-package problem_454
+package problem454
 
 func fourSumCount(A []int, B []int, C []int, D []int) int {
 	ans, n := 0, len(A)
 
@@ -1,4 +1,4 @@
-package problem_454
+package problem454
 
 import "testing"
 
 
@@ -1,4 +1,4 @@
-package problem_18
+package problem18
 
 import "sort"
 
 
@@ -1,4 +1,4 @@
-package problem_18
+package problem18
 
 import (
 	"reflect"
 
@@ -1,4 +1,4 @@
-package accounts_merge
+package problem721
 
 import "sort"
 
 
@@ -1,4 +1,4 @@
-package accounts_merge
+package problem721
 
 import (
 	"reflect"
 
@@ -1 +1 @@
-package add_and_search_word_data_structure_design
+package problem211
@@ -1 +1 @@
-package add_and_search_word_data_structure_design
+package problem211
@@ -1,4 +1,4 @@
-package problem_67
+package problem67
 
 func addBinary(a string, b string) string {
 	ans, l1, l2, carry := "", len(a)-1, len(b)-1, byte('0')
 
@@ -1,4 +1,4 @@
-package problem_67
+package problem67
 
 import "testing"
 
 
@@ -1 +1 @@
-package add_bold_tag_in_string
+package problem616
@@ -1 +1 @@
-package add_bold_tag_in_string
+package problem616
@@ -1,4 +1,4 @@
-package add_digits
+package problem258
 
 func addDigits(num int) int {
 	return (num-1)%9 + 1
 
@@ -1,4 +1,4 @@
-package add_digits
+package problem258
 
 import "testing"
 
 
@@ -1,4 +1,4 @@
-package add_one_row_to_tree
+package problem623
 
 import "github.com/openset/leetcode/internal/kit"
 
 
@@ -1,4 +1,4 @@
-package add_one_row_to_tree
+package problem623
 
 import (
 	"reflect"
 
@@ -1,4 +1,4 @@
-package problem_415
+package problem415
 
 func addStrings(num1 string, num2 string) string {
 	ans, l1, l2, carry := "", len(num1)-1, len(num2)-1, byte('0')
 
@@ -1,4 +1,4 @@
-package problem_415
+package problem415
 
 import "testing"
 
 
@@ -1,4 +1,4 @@
-package add_to_array_form_of_integer
+package problem989
 
 func addToArrayForm(A []int, K int) []int {
 	ans, carry, l := make([]int, 0), 0, len(A)-1
 
@@ -1,4 +1,4 @@
-package add_to_array_form_of_integer
+package problem989
 
 import (
 	"reflect"
 
@@ -1,4 +1,4 @@
-package problem_445
+package problem445
 
 import "github.com/openset/leetcode/internal/kit"
 
 
@@ -1,4 +1,4 @@
-package problem_445
+package problem445
 
 import (
 	"reflect"
 
@@ -1,4 +1,4 @@
-package problem_2
+package problem2
 
 import "github.com/openset/leetcode/internal/kit"
 
 
@@ -1,4 +1,4 @@
-package problem_2
+package problem2
 
 import (
 	"reflect"
 
@@ -1,4 +1,4 @@
-package adding_two_negabinary_numbers
+package problem1073
 
 func addNegabinary(A, B []int) []int {
 	i, j := len(A)-1, len(B)-1
 
@@ -1 +1 @@
-package additive_number
+package problem306
@@ -1 +1 @@
-package additive_number
+package problem306
@@ -1 +1 @@
-package advantage_shuffle
+package problem870
@@ -1 +1 @@
-package advantage_shuffle
+package problem870
@@ -1 +1 @@
-package alien_dictionary
+package problem269
@@ -1 +1 @@
-package alien_dictionary
+package problem269
@@ -1 +1 @@
-package all_nodes_distance_k_in_binary_tree
+package problem863
@@ -1 +1 @@
-package all_nodes_distance_k_in_binary_tree
+package problem863
@@ -1 +1 @@
-package all_oone_data_structure
+package problem432
@@ -1 +1 @@
-package all_oone_data_structure
+package problem432
@@ -1 +1 @@
-package all_paths_from_source_to_target
+package problem797
@@ -1 +1 @@
-package all_paths_from_source_to_target
+package problem797
@@ -1 +1 @@
-package all_possible_full_binary_trees
+package problem894
@@ -1 +1 @@
-package all_possible_full_binary_trees
+package problem894
@@ -1,4 +1,4 @@
-package alphabet_board_path
+package problem1138
 
 import "strings"
 
 
@@ -1 +1 @@
-package ambiguous_coordinates
+package problem816
@@ -1 +1 @@
-package ambiguous_coordinates
+package problem816
@@ -1 +1 @@
-package android_unlock_patterns
+package problem351
@@ -1 +1 @@
-package android_unlock_patterns
+package problem351
@@ -1 +1 @@
-package arithmetic_slices_ii_subsequence
+package problem446
@@ -1 +1 @@
-package arithmetic_slices_ii_subsequence
+package problem446
@@ -1,4 +1,4 @@
-package problem_413
+package problem413
 
 func numberOfArithmeticSlices(A []int) int {
 	ans, i, j, l := 0, 0, 0, len(A)-1
 
@@ -1,4 +1,4 @@
-package problem_413
+package problem413
 
 import "testing"
 
 
@@ -1,4 +1,4 @@
-package problem_441
+package problem441
 
 import "math"
 
 
@@ -1,4 +1,4 @@
-package problem_441
+package problem441
 
 import "testing"
 
 
@@ -1,4 +1,4 @@
-package problem_565
+package problem565
 
 func arrayNesting(nums []int) int {
 	ans := 0
Original file line number	Diff line number	Diff line change
`@@ -13,13 +13,15 @@ import (`
`13`	`13`	`"sync"`
`14`	`14`	`)`
`15`	`15`
	`16`	`+// CmdName`
`16`	`17`	`const CmdName = "leetcode"`
`17`	`18`
`18`	`19`	`var (`
`19`	`20`	`Commands []*Command`
`20`	`21`	`Mutex sync.Mutex`
`21`	`22`	`)`
`22`	`23`
	`24`	`+// Command`
`23`	`25`	`type Command struct {`
`24`	`26`	`Run func(cmd *Command, args []string)`
`25`	`27`	`UsageLine string`
Original file line number	Diff line number	Diff line change
`@@ -208,7 +208,7 @@ func (question *questionType) LeetCodeUrl() string {`
`208`	`208`	`}`
`209`	`209`
`210`	`210`	`func (question *questionType) PackageName() string {`
`211`		`- return "problem_" + question.QuestionFrontendId`
	`211`	`+ return "problem" + question.QuestionFrontendId`
`212`	`212`	`}`
`213`	`213`
`214`	`214`	`func (question *questionType) SaveCodeSnippet() {`
`@@ -234,7 +234,7 @@ func (question *questionType) SaveCodeSnippet() {`
`234`	`234`	`for _, lang := range langSupport {`
`235`	`235`	`if code, ok := codeSet[lang.slug]; ok {`
`236`	`236`	`lang.handle(question, code)`
`237`		`- break`
	`237`	`+ return`
`238`	`238`	`}`
`239`	`239`	`}`
`240`	`240`	`}`
`@@ -255,6 +255,18 @@ func (question *questionType) saveMysqlSchemas() {`
`255`	`255`	`filePutContents(question.getFilePath("mysql_schemas.sql"), buf.Bytes())`
`256`	`256`	`}`
`257`	`257`
	`258`	`+func (question *questionType) RenamePackageName() {`
	`259`	`+ packageName := fmt.Sprintf("package %s", question.PackageName())`
	`260`	+ reg := regexp.MustCompile(`package \w+`)
	`261`	`+ for _, ext := range [...]string{".go", "_test.go"} {`
	`262`	`+ cts := fileGetContents(question.getFilePath(question.TitleSnake() + ext))`
	`263`	`+ if len(cts) > 0 {`
	`264`	`+ content := reg.ReplaceAllString(string(cts), packageName)`
	`265`	`+ question.saveCodeContent(content, ext)`
	`266`	`+ }`
	`267`	`+ }`
	`268`	`+}`
	`269`	`+`
`258`	`270`	`func handleCodeGolang(question *questionType, code codeSnippetsType) {`
`259`	`271`	`content := fmt.Sprintf("package %s\n\n", question.PackageName())`
`260`	`272`	`content += code.Code + "\n"`
Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@ import (`
`8`	`8`	`"github.com/openset/leetcode/internal/base"`
`9`	`9`	`)`
`10`	`10`
`11`		`-const version = "1.4.8"`
	`11`	`+const version = "1.4.9"`
`12`	`12`
`13`	`13`	`var CmdVersion = &base.Command{`
`14`	`14`	`Run: runVersion,`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package problem_542`
	`1`	`+package problem542`
`2`	`2`
`3`	`3`	`func updateMatrix(matrix [][]int) [][]int {`
`4`	`4`	`m, n := len(matrix), len(matrix[0])`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package problem_717`
	`1`	`+package problem717`
`2`	`2`
`3`	`3`	`func isOneBitCharacter(bits []int) bool {`
`4`	`4`	`i, l := 0, len(bits)-1`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package problem_456`
	`1`	`+package problem456`
`2`	`2`
`3`	`3`	`func find132pattern(nums []int) bool {`
`4`	`4`	`ak, ajStack := -1<<31, make([]int, 0, len(nums))`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package problem_650`
	`1`	`+package problem650`
`2`	`2`
`3`	`3`	`func minSteps(n int) int {`
`4`	`4`	`if n == 1 {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package problem_679`
	`1`	`+package problem679`
`2`	`2`
`3`	`3`	`import "sort"`
`4`	`4`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package problem_16`
	`1`	`+package problem16`
`2`	`2`
`3`	`3`	`import (`
`4`	`4`	`"math"`
Original file line number	Diff line number	Diff line change
`@@ -1 +1 @@`
`1`		`-package problem_258`
	`1`	`+package problem259`