format with golint

Author: lijinglin3

algorithm/sort/bucket.go

@@ -13,6 +13,7 @@ func getMax(a []int) int {
 	return max
 }
 
+// BucketSort 桶排序
 func BucketSort(a []int) {
 	num := len(a)
 	if num <= 1 {

algorithm/sort/counting.go

@@ -2,6 +2,7 @@ package sort
 
 import "math"
 
+// CountingSort 计数排序
 func CountingSort(a []int) {
 	n := len(a)
 	if n <= 1 {

algorithm/sort/merge.go

@@ -1,5 +1,6 @@
 package sort
 
+// MergeSort 归并排序
 func MergeSort(arr []int) {
 	arrLen := len(arr)
 	if arrLen <= 1 {

leetcode/0008.string-to-integer-atoi/string_to_integer_atoi.go

@@ -4,7 +4,7 @@ import (
 	"strconv"
 )
 
-func MyAtoi(str string) int {
+func myAtoi(str string) int {
 	result := ""
 	b1, b2 := false, false
 	for _, v := range str {

leetcode/0008.string-to-integer-atoi/string_to_integer_atoi_test.go

@@ -3,5 +3,5 @@ package leetcode
 import "testing"
 
 func TestMyAtoi(t *testing.T) {
-	MyAtoi("    -43   22")
+	myAtoi("    -43   22")
 }

leetcode/0019.remove-nth-node-from-end-of-list/remove_nth_node_from_end_of_list.go

@@ -1,11 +1,8 @@
 package leetcode
 
-type ListNode struct {
-	Val  int
-	Next *ListNode
-}
+import . "github.com/lijinglin2019/algorithm-go/leetcode/common"
 
-func RemoveNthFromEnd(head *ListNode, n int) *ListNode {
+func removeNthFromEnd(head *ListNode, n int) *ListNode {
 	p1, p2 := head, head
 	for i := 0; i < n; i++ {
 		p2 = p2.Next

leetcode/0021.merge-two-sorted-lists/merge_two_sorted_lists.go

@@ -1,11 +1,8 @@
 package leetcode
 
-type ListNode struct {
-	Val  int
-	Next *ListNode
-}
+import . "github.com/lijinglin2019/algorithm-go/leetcode/common"
 
-func MergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
+func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
 	result, tmp := &ListNode{}, &ListNode{}
 	cur := result
 	for l1 != nil && l2 != nil {

leetcode/0028.implement-strstr/implement_strstr.go

@@ -2,6 +2,6 @@ package leetcode
 
 import "strings"
 
-func StrStr(haystack string, needle string) int {
+func strStr(haystack string, needle string) int {
 	return strings.Index(haystack, needle)
 }

leetcode/0036.valid-sudoku/valid_sudoku.go

@@ -1,6 +1,6 @@
 package leetcode
 
-func IsValidSudoku(board [][]byte) bool {
+func isValidSudoku(board [][]byte) bool {
 	rows := make([]map[byte]interface{}, 9)
 	columns := make([]map[byte]interface{}, 9)
 	boxes := make([]map[byte]interface{}, 9)

leetcode/0036.valid-sudoku/valid_sudoku_test.go

@@ -56,6 +56,6 @@ func TestIsValidSudoku(t *testing.T) {
 	results := []bool{true, false, false, false}
 
 	for i := range cases {
-		assert.Equal(t, results[i], IsValidSudoku(cases[i]))
+		assert.Equal(t, results[i], isValidSudoku(cases[i]))
 	}
 }

leetcode/0038.count-and-say/count_and_say.go

@@ -2,7 +2,7 @@ package leetcode
 
 import "strconv"
 
-func CountAndSay(n int) string {
+func countAndSay(n int) string {
 	result := "1"
 	for n > 1 {
 		tag := result[0]

leetcode/0048.rotate-image/rotate_image.go

@@ -1,6 +1,6 @@
 package leetcode
 
-func Rotate(matrix [][]int) {
+func rotate(matrix [][]int) {
 	length := len(matrix)
 	if length <= 1 {
 		return

leetcode/0048.rotate-image/rotate_image_test.go

@@ -47,7 +47,7 @@ func TestRotate(t *testing.T) {
 	}
 
 	for i := range cases {
-		Rotate(cases[i])
+		rotate(cases[i])
 		assert.Equal(t, results[i], cases[i])
 	}
 }

leetcode/0058.length-of-last-word/length_of_last_word.go

@@ -1,6 +1,6 @@
 package leetcode
 
-func LengthOfLastWord(s string) int {
+func lengthOfLastWord(s string) int {
 	length := len(s)
 	result := 0
 	index := length - 1

leetcode/0058.length-of-last-word/length_of_last_word_test.go

@@ -16,6 +16,6 @@ func TestLengthOfLastWord(t *testing.T) {
 	results := []int{5, 5, 10, 0}
 
 	for i := range cases {
-		assert.Equal(t, results[i], LengthOfLastWord(cases[i]))
+		assert.Equal(t, results[i], lengthOfLastWord(cases[i]))
 	}
 }

leetcode/0066.plus-one/plus_one.go

@@ -1,6 +1,6 @@
 package leetcode
 
-func PlusOne(digits []int) []int {
+func plusOne(digits []int) []int {
 	flag := true
 	for i := len(digits) - 1; i >= 0; i-- {
 		if flag {

leetcode/0066.plus-one/plus_one_test.go

@@ -21,6 +21,6 @@ func TestPlusOne(t *testing.T) {
 	}
 
 	for i := range cases {
-		assert.Equal(t, results[i], PlusOne(cases[i]))
+		assert.Equal(t, results[i], plusOne(cases[i]))
 	}
 }

leetcode/0094.binary-tree-inorder-traversal/binary_tree_inorder_traversal.go

@@ -2,20 +2,20 @@ package leetcode
 
 import . "github.com/lijinglin2019/algorithm-go/leetcode/common"
 
-func InorderTraversal(root *TreeNode) []int {
+func inorderTraversal(root *TreeNode) []int {
 	var result []int
 	if root == nil {
 		return nil
 	}
 
-	result = append(result, InorderTraversal(root.Left)...)
+	result = append(result, inorderTraversal(root.Left)...)
 	result = append(result, root.Val)
-	result = append(result, InorderTraversal(root.Right)...)
+	result = append(result, inorderTraversal(root.Right)...)
 
 	return result
 }
 
-func InorderTraversalByStack(root *TreeNode) []int {
+func inorderTraversalByStack(root *TreeNode) []int {
 	var result []int
 	stack := make([]*TreeNode, 0)
 	n := root

leetcode/0094.binary-tree-inorder-traversal/binary_tree_inorder_traversal_test.go

@@ -21,7 +21,7 @@ func TestInorderTraversal(t *testing.T) {
 	}
 
 	for i := range cases {
-		assert.Equal(t, results[i], InorderTraversal(cases[i]))
+		assert.Equal(t, results[i], inorderTraversal(cases[i]))
 	}
 }
 
@@ -38,6 +38,6 @@ func TestInorderTraversalByStack(t *testing.T) {
 	}
 
 	for i := range cases {
-		assert.Equal(t, results[i], InorderTraversalByStack(cases[i]))
+		assert.Equal(t, results[i], inorderTraversalByStack(cases[i]))
 	}
 }

leetcode/0098.validate-binary-search-tree/validate_binary_search_tree.go

@@ -1,14 +1,12 @@
 package leetcode
 
-import "math"
+import (
+	"math"
 
-type TreeNode struct {
-	Val   int
-	Left  *TreeNode
-	Right *TreeNode
-}
+	. "github.com/lijinglin2019/algorithm-go/leetcode/common"
+)
 
-func IsValidBST(root *TreeNode) bool {
+func isValidBST(root *TreeNode) bool {
 	min := math.MinInt64
 	stack := make([]*TreeNode, 0)
 	for len(stack) > 0 || root != nil {

leetcode/0101.symmetric-tree/symmetric_tree.go

@@ -2,7 +2,7 @@ package leetcode
 
 import . "github.com/lijinglin2019/algorithm-go/leetcode/common"
 
-func IsSymmetric(root *TreeNode) bool {
+func isSymmetric(root *TreeNode) bool {
 	queue := []*TreeNode{root, root}
 	for len(queue) > 0 {
 		n1 := queue[len(queue)-1]
@@ -23,7 +23,7 @@ func IsSymmetric(root *TreeNode) bool {
 	return true
 }
 
-func IsSymmetricByRecursive(root *TreeNode) bool {
+func isSymmetricByRecursive(root *TreeNode) bool {
 	return isMirror(root, root)
 }
 

leetcode/0101.symmetric-tree/symmetric_tree_test.go

@@ -25,7 +25,7 @@ func TestIsSymmetric(t *testing.T) {
 	}
 
 	for i := range cases {
-		assert.Equal(t, results[i], IsSymmetric(cases[i]))
-		assert.Equal(t, results[i], IsSymmetricByRecursive(cases[i]))
+		assert.Equal(t, results[i], isSymmetric(cases[i]))
+		assert.Equal(t, results[i], isSymmetricByRecursive(cases[i]))
 	}
 }

leetcode/0102.binary-tree-level-order-traversal/binary_tree_level_order_traversal.go

@@ -2,7 +2,7 @@ package leetcode
 
 import . "github.com/lijinglin2019/algorithm-go/leetcode/common"
 
-func LevelOrder(root *TreeNode) [][]int {
+func levelOrder(root *TreeNode) [][]int {
 	if root == nil {
 		return nil
 	}

leetcode/0102.binary-tree-level-order-traversal/binary_tree_level_order_traversal_test.go

@@ -21,6 +21,6 @@ func TestLevelOrder(t *testing.T) {
 	}
 
 	for i := range cases {
-		assert.Equal(t, results[i], LevelOrder(cases[i]))
+		assert.Equal(t, results[i], levelOrder(cases[i]))
 	}
 }

leetcode/0104.maximum-depth-of-binary-tree/maximum_depth_of_binary_tree.go

@@ -2,12 +2,12 @@ package leetcode
 
 import . "github.com/lijinglin2019/algorithm-go/leetcode/common"
 
-func MaxDepth(root *TreeNode) int {
+func maxDepth(root *TreeNode) int {
 	if root == nil {
 		return 0
 	}
-	left := MaxDepth(root.Left)
-	right := MaxDepth(root.Right)
+	left := maxDepth(root.Left)
+	right := maxDepth(root.Right)
 
 	if left > right {
 		return left + 1
@@ -16,7 +16,7 @@ func MaxDepth(root *TreeNode) int {
 
 }
 
-func MaxDepthByBFS(root *TreeNode) int {
+func maxDepthByBFS(root *TreeNode) int {
 	if root == nil {
 		return 0
 	}
@@ -40,7 +40,7 @@ func MaxDepthByBFS(root *TreeNode) int {
 	return depth
 }
 
-func MaxDepthByDFS(root *TreeNode) int {
+func maxDepthByDFS(root *TreeNode) int {
 	if root == nil {
 		return 0
 	}

leetcode/0104.maximum-depth-of-binary-tree/maximum_depth_of_binary_tree_test.go

@@ -21,8 +21,8 @@ func TestMaxDepth(t *testing.T) {
 	}
 
 	for i := range cases {
-		assert.Equal(t, results[i], MaxDepth(cases[i]))
-		assert.Equal(t, results[i], MaxDepthByBFS(cases[i]))
-		assert.Equal(t, results[i], MaxDepthByDFS(cases[i]))
+		assert.Equal(t, results[i], maxDepth(cases[i]))
+		assert.Equal(t, results[i], maxDepthByBFS(cases[i]))
+		assert.Equal(t, results[i], maxDepthByDFS(cases[i]))
 	}
 }

leetcode/0108.convert-sorted-array-to-binary-search-tree/convert_sorted_array_to_binary_search_tree.go

@@ -1,12 +1,8 @@
 package leetcode
 
-type TreeNode struct {
-	Val   int
-	Left  *TreeNode
-	Right *TreeNode
-}
+import . "github.com/lijinglin2019/algorithm-go/leetcode/common"
 
-func SortedArrayToBST(nums []int) *TreeNode {
+func sortedArrayToBST(nums []int) *TreeNode {
 	length := len(nums)
 	if length == 0 {
 		return nil
@@ -15,5 +11,5 @@ func SortedArrayToBST(nums []int) *TreeNode {
 	mid := length / 2
 	left := nums[:mid]
 	right := nums[mid+1:]
-	return &TreeNode{Val: nums[mid], Left: SortedArrayToBST(left), Right: SortedArrayToBST(right)}
+	return &TreeNode{Val: nums[mid], Left: sortedArrayToBST(left), Right: sortedArrayToBST(right)}
 }

leetcode/0110.balanced-binary-tree/balanced_binary_tree.go

@@ -4,7 +4,7 @@ import (
 	. "github.com/lijinglin2019/algorithm-go/leetcode/common"
 )
 
-func IsBalanced(root *TreeNode) bool {
+func isBalanced(root *TreeNode) bool {
 	if root == nil {
 		return true
 	}

leetcode/0110.balanced-binary-tree/balanced_binary_tree_test.go

@@ -25,6 +25,6 @@ func TestIsBalanced(t *testing.T) {
 	}
 
 	for i := range cases {
-		assert.Equal(t, results[i], IsBalanced(cases[i]))
+		assert.Equal(t, results[i], isBalanced(cases[i]))
 	}
 }

leetcode/0111.minimum-depth-of-binary-tree/minimum_depth_of_binary_tree.go

@@ -1,10 +1,8 @@
 package leetcode
 
-import (
-	. "github.com/lijinglin2019/algorithm-go/leetcode/common"
-)
+import . "github.com/lijinglin2019/algorithm-go/leetcode/common"
 
-func MinDepth(root *TreeNode) int {
+func minDepth(root *TreeNode) int {
 	if nil == root {
 		return 0
 	}

leetcode/0111.minimum-depth-of-binary-tree/minimum_depth_of_binary_tree_test.go

@@ -21,6 +21,6 @@ func TestMinDepth(t *testing.T) {
 	}
 
 	for i := range cases {
-		assert.Equal(t, results[i], MinDepth(cases[i]))
+		assert.Equal(t, results[i], minDepth(cases[i]))
 	}
 }

leetcode/0112.path-sum/path_sum.go

@@ -2,7 +2,7 @@ package leetcode
 
 import . "github.com/lijinglin2019/algorithm-go/leetcode/common"
 
-func HasPathSum(root *TreeNode, sum int) bool {
+func hasPathSum(root *TreeNode, sum int) bool {
 	if nil == root {
 		return false
 	}

leetcode/0112.path-sum/path_sum_test.go

@@ -29,6 +29,6 @@ func TestHasPathSum(t *testing.T) {
 	}
 
 	for i := range cases {
-		assert.Equal(t, results[i], HasPathSum(cases[i], sums[i]))
+		assert.Equal(t, results[i], hasPathSum(cases[i], sums[i]))
 	}
 }

leetcode/0121.best-time-to-buy-and-sell-stock/best_time_to_buy_and_sell_stock.go

@@ -1,6 +1,6 @@
 package leetcode
 
-func MaxProfit(prices []int) int {
+func maxProfit(prices []int) int {
 	l := len(prices)
 	if l <= 1 {
 		return 0

leetcode/0122.best-time-to-buy-and-sell-stock-ii/best_time_to_buy_and_sell_stock_ii.go

@@ -1,6 +1,6 @@
 package leetcode
 
-func MaxProfit(prices []int) int {
+func maxProfit(prices []int) int {
 	l := len(prices)
 	if l <= 1 {
 		return 0