FIX GO_LINT

Author: halfrost

Algorithms/0007. Reverse Integer/7. Reverse Integer.go

@@ -1,6 +1,6 @@
 package leetcode
 
-func reverse_7(x int) int {
+func reverse7(x int) int {
 	tmp := 0
 	for x != 0 {
 		tmp = tmp*10 + x%10

Algorithms/0007. Reverse Integer/7. Reverse Integer_test.go

@@ -51,7 +51,7 @@ func Test_Problem7(t *testing.T) {
 
 	for _, q := range qs {
 		_, p := q.ans7, q.para7
-		fmt.Printf("【input】:%v    【output】:%v\n", p.one, reverse_7(p.one))
+		fmt.Printf("【input】:%v    【output】:%v\n", p.one, reverse7(p.one))
 	}
 	fmt.Printf("\n\n\n")
 }

Algorithms/0015. 3Sum/15. 3Sum.go

@@ -12,7 +12,7 @@ func threeSum(nums []int) [][]int {
 	}
 
 	uniqNums := []int{}
-	for key, _ := range counter {
+	for key := range counter {
 		uniqNums = append(uniqNums, key)
 	}
 	sort.Ints(uniqNums)

Algorithms/0016. 3Sum Closest/16. 3Sum Closest.go

@@ -30,7 +30,7 @@ func threeSumClosest(nums []int, target int) int {
 }
 
 // 解法二 暴力解法 O(n^3)
-func threeSumClosest_(nums []int, target int) int {
+func threeSumClosest1(nums []int, target int) int {
 	res, difference := 0, math.MaxInt16
 	for i := 0; i < len(nums); i++ {
 		for j := i + 1; j < len(nums); j++ {

Algorithms/0018. 4Sum/18. 4Sum.go

@@ -10,7 +10,7 @@ func fourSum(nums []int, target int) [][]int {
 	}
 
 	uniqNums := []int{}
-	for key, _ := range counter {
+	for key := range counter {
 		uniqNums = append(uniqNums, key)
 	}
 	sort.Ints(uniqNums)

Algorithms/0019. Remove Nth Node From End of List/19. Remove Nth Node From End of List.go

@@ -29,7 +29,7 @@ func removeNthFromEnd(head *ListNode, n int) *ListNode {
 }
 
 // 解法二
-func removeNthFromEnd_(head *ListNode, n int) *ListNode {
+func removeNthFromEnd1(head *ListNode, n int) *ListNode {
 	if head == nil {
 		return nil
 	}

Algorithms/0021. Merge Two Sorted Lists/21. Merge Two Sorted Lists.go

@@ -17,56 +17,7 @@ func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
 	if l1.Val < l2.Val {
 		l1.Next = mergeTwoLists(l1.Next, l2)
 		return l1
-	} else {
-		l2.Next = mergeTwoLists(l1, l2.Next)
-		return l2
 	}
-	// if l1 == nil && l2 == nil {
-	// 	return nil
-	// }
-	// head := &ListNode{Val: 0, Next: nil}
-	// current := head
-	// var currentl1, currentl2 *ListNode
-	// for l1 != nil || l2 != nil {
-	// 	if l1 != nil {
-	// 		currentl1 = &ListNode{Val: l1.Val, Next: nil}
-	// 	}
-	// 	if l2 != nil {
-	// 		currentl2 = &ListNode{Val: l2.Val, Next: nil}
-	// 	}
-
-	// 	if l1 == nil && l2 != nil {
-	// 		current.Next = currentl2
-	// 		current = currentl2
-	// 		l2 = l2.Next
-	// 		continue
-	// 	} else if l2 == nil && l1 != nil {
-	// 		current.Next = currentl1
-	// 		current = currentl1
-	// 		l1 = l1.Next
-	// 		continue
-	// 	} else if l2 == nil && l1 == nil {
-	// 		return head.Next
-	// 	} else {
-	// 		if currentl1.Val < currentl2.Val {
-	// 			current.Next = currentl1
-	// 			current = currentl1
-	// 			l1 = l1.Next
-	// 			continue
-	// 		} else if currentl1.Val == currentl2.Val {
-	// 			current.Next = currentl2
-	// 			currentl2.Next = currentl1
-	// 			current = currentl1
-	// 			l1 = l1.Next
-	// 			l2 = l2.Next
-	// 			continue
-	// 		} else {
-	// 			current.Next = currentl2
-	// 			current = currentl2
-	// 			l2 = l2.Next
-	// 			continue
-	// 		}
-	// 	}
-	// }
-	// return head.Next
+	l2.Next = mergeTwoLists(l1, l2.Next)
+	return l2
 }

Algorithms/0023. Merge k Sorted Lists/23. Merge k Sorted Lists.go

@@ -31,8 +31,7 @@ func mergeTwoLists1(l1 *ListNode, l2 *ListNode) *ListNode {
 	if l1.Val < l2.Val {
 		l1.Next = mergeTwoLists1(l1.Next, l2)
 		return l1
-	} else {
-		l2.Next = mergeTwoLists1(l1, l2.Next)
-		return l2
 	}
+	l2.Next = mergeTwoLists1(l1, l2.Next)
+	return l2
 }

Algorithms/0026. Remove Duplicates from Sorted Array/26. Remove Duplicates from Sorted Array.go

@@ -14,13 +14,13 @@ func removeDuplicates(nums []int) int {
 			}
 		}
 		nums[last+1] = nums[finder]
-		last += 1
+		last++
 	}
 	return last + 1
 }
 
 // 解法二
-func removeDuplicates_(nums []int) int {
+func removeDuplicates1(nums []int) int {
 	if len(nums) == 0 {
 		return 0
 	}
@@ -32,14 +32,14 @@ func removeDuplicates_(nums []int) int {
 			break
 		}
 		if nums[i+1] == nums[i] {
-			removeElement_(nums, i+1, nums[i])
+			removeElement1(nums, i+1, nums[i])
 			// fmt.Printf("此时 num = %v length = %v\n", nums, length)
 		}
 	}
 	return i + 1
 }
 
-func removeElement_(nums []int, start, val int) int {
+func removeElement1(nums []int, start, val int) int {
 	if len(nums) == 0 {
 		return 0
 	}

Algorithms/0028. Implement strStr()/28. Implement strStr().go

@@ -20,6 +20,6 @@ func strStr(haystack string, needle string) int {
 }
 
 // 解法二
-func strStr_(haystack string, needle string) int {
+func strStr1(haystack string, needle string) int {
 	return strings.Index(haystack, needle)
 }