fix some error

medium/12.go

@@ -2,7 +2,6 @@ package main
 
 import (
 	"bytes"
-	"fmt"
 	"math"
 )
 
@@ -74,6 +73,6 @@ func intToRoman(num int) string {
 	return res.String()
 }
 
-func main() {
+/* func main() {
 	fmt.Println(intToRoman(1998))
-}
+} */

medium/15.go

@@ -1,7 +1,6 @@
 package main
 
 import (
-	"fmt"
 	"sort"
 )
 
@@ -59,7 +58,7 @@ func threeSum(nums []int) [][]int {
 	return res
 }
 
-func main() {
+/* func main() {
 	a1 := []int{-1, 0, 1, 2, -1, -4}
 	fmt.Println(threeSum(a1))
 
@@ -68,4 +67,4 @@ func main() {
 
 	a3 := []int{0, 0, 0}
 	fmt.Println(threeSum(a3))
-}
+} */

medium/16.go

@@ -1,7 +1,6 @@
 package main
 
 import (
-	"fmt"
 	"sort"
 )
 
@@ -39,7 +38,7 @@ func threeSumClosest(nums []int, target int) int {
 	return res
 }
 
-func main() {
+/* func main() {
 	a1 := []int{-1, 0, 1, 2, -1, -4}
 	fmt.Println(threeSumClosest(a1, 0))
 
@@ -48,4 +47,4 @@ func main() {
 
 	a3 := []int{1, 1, 1, 0}
 	fmt.Println(threeSumClosest(a3, 100))
-}
+} */

medium/17.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 var mBtn = map[byte][]string{
 	'2': {"a", "b", "c"},
 	'3': {"d", "e", "f"},
@@ -36,7 +32,8 @@ func letterCombinations(digits string) []string {
 	return letterCombinationsIter(digits[1:], mBtn[digits[0]])
 }
 
-func main() {
+/* func main() {
 	fmt.Println(letterCombinations("23"))
 	fmt.Println(letterCombinations("234"))
 }
+*/

medium/18.go

@@ -1,11 +1,10 @@
 package main
 
 import (
-	"fmt"
 	"sort"
 )
 
-func threeSum(nums []int, target int) [][]int {
+func threeSumForTarget(nums []int, target int) [][]int {
 	if len(nums) < 3 {
 		return [][]int{}
 	}
@@ -44,7 +43,7 @@ func fourSum(nums []int, target int) [][]int {
 		if i > 0 && nums[i] == nums[i-1] {
 			continue
 		}
-		tmp := threeSum(nums[i+1:], target-nums[i])
+		tmp := threeSumForTarget(nums[i+1:], target-nums[i])
 		for _, v := range tmp {
 			res = append(res, append([]int{nums[i]}, v...))
 		}
@@ -52,7 +51,7 @@ func fourSum(nums []int, target int) [][]int {
 	return res
 }
 
-func main() {
+/* func main() {
 	a1 := []int{1, 0, -1, 0, -2, 2}
 	fmt.Println(fourSum(a1, 0))
-}
+} */

medium/19.go

@@ -1,9 +1,6 @@
 package main
 
-import (
-	"fmt"
-)
-
+// ListNode ...
 type ListNode struct {
 	Val  int
 	Next *ListNode
@@ -42,7 +39,7 @@ func removeNthFromEnd(head *ListNode, n int) *ListNode {
 	return head
 }
 
-func main() {
+/* func main() {
 	l15 := ListNode{5, nil}
 	l14 := ListNode{4, &l15}
 	l13 := ListNode{3, &l14}
@@ -52,4 +49,4 @@ func main() {
 	l22 := ListNode{2, nil}
 	l2 := &ListNode{1, &l22}
 	fmt.Println(list2str(removeNthFromEnd(l2, 2)))
-}
+} */

medium/2.go

@@ -1,15 +1,12 @@
 package main
 
-import (
-	"fmt"
-)
-
-type ListNode struct {
+/* type ListNode struct {
 	Val  int
 	Next *ListNode
 }
+*/
 
-func list2str(head *ListNode) string {
+/* func list2str(head *ListNode) string {
 	curr := head
 	str := make([]rune, 0)
 	for curr != nil {
@@ -18,7 +15,7 @@ func list2str(head *ListNode) string {
 	}
 	return string(str)
 }
-
+*/
 func list2int(head *ListNode) int64 {
 	beg := head
 	res := int64(0)
@@ -92,7 +89,7 @@ func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
 	return head
 }
 
-func main() {
+/* func main() {
 	l13 := ListNode{3, nil}
 	l12 := ListNode{2, &l13}
 	l1 := &ListNode{1, &l12}
@@ -100,4 +97,4 @@ func main() {
 	l22 := ListNode{9, &l23}
 	l2 := &ListNode{1, &l22}
 	fmt.Println(list2str(addTwoNumbers(l1, l2)))
-}
+} */

medium/22.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func generateParenthesisIter(last string, left, right, goal int, res *[]string) {
 	if right == goal {
 		*res = append(*res, last)
@@ -23,6 +19,6 @@ func generateParenthesis(n int) []string {
 	return *res
 }
 
-func main() {
+/* func main() {
 	fmt.Println(generateParenthesis(3))
-}
+} */

medium/24.go

@@ -1,13 +1,11 @@
 package main
 
-import "fmt"
-
-type ListNode struct {
+/* type ListNode struct {
 	Val  int
 	Next *ListNode
-}
+} */
 
-func list2str(head *ListNode) string {
+/* func list2str(head *ListNode) string {
 	curr := head
 	str := make([]rune, 0)
 	for curr != nil {
@@ -15,7 +13,7 @@ func list2str(head *ListNode) string {
 		curr = curr.Next
 	}
 	return string(str)
-}
+} */
 
 /**
  * Definition for singly-linked list.
@@ -67,7 +65,7 @@ func swapPairs(head *ListNode) *ListNode {
 	return dummy.Next
 }
 
-func main() {
+/* func main() {
 	l15 := ListNode{5, nil}
 	l14 := ListNode{4, &l15}
 	l13 := ListNode{3, &l14}
@@ -82,4 +80,4 @@ func main() {
 	l3 := &ListNode{1, &l32}
 	fmt.Println(list2str(swapPairs(l3)))
 	fmt.Println(list2str(swapPairs(&ListNode{1, nil})))
-}
+} */

medium/29.go

@@ -1,16 +1,15 @@
 package main
 
 import (
-	"fmt"
 	"math"
 )
 
-func abs(x int) int {
+/* func abs(x int) int {
 	if x < 0 {
 		return -x
 	}
 	return x
-}
+} */
 
 // time out
 func divideOld(dividend int, divisor int) int {
@@ -56,10 +55,10 @@ func divide(dividend int, divisor int) int {
 	return res
 }
 
-func main() {
+/* func main() {
 	fmt.Println(divide(-1, 1))
 	fmt.Println(divide(-1, -1))
 	fmt.Println(divide(-1<<31, -1))
 	fmt.Println(divide(1, 1))
 	fmt.Println(divide(535, 1))
-}
+} */

medium/31.go

@@ -1,11 +1,7 @@
 package main
 
-import (
-	"fmt"
-)
-
 // “字典序”
-func nextPermutation(nums []int) {
+/* func nextPermutation(nums []int) {
 	if len(nums) < 2 {
 		return
 	}
@@ -28,9 +24,9 @@ func nextPermutation(nums []int) {
 	for l, r := i+1, len(nums)-1; l < r; l, r = l+1, r-1 {
 		nums[l], nums[r] = nums[r], nums[l]
 	}
-}
+} */
 
-func main() {
+/* func main() {
 	a1 := []int{1, 2, 3}
 	a2 := []int{3, 2, 1}
 	a3 := []int{2, 3, 1}
@@ -43,4 +39,4 @@ func main() {
 	fmt.Println(a2)
 	fmt.Println(a3)
 	fmt.Println(a4)
-}
+} */

medium/33.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func searchOld(nums []int, target int) int {
 	for i, v := range nums {
 		if v == target {
@@ -48,9 +44,9 @@ func search(nums []int, target int) int {
 	return -1
 }
 
-func main() {
+/* func main() {
 	a1 := []int{4, 5, 6, 0, 1, 2, 3}
 	a2 := []int{1, 3}
 	fmt.Println(search(a1, 6))
 	fmt.Println(search(a2, 3))
-}
+} */

medium/34.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 // important
 func searchRange(nums []int, target int) []int {
 	beg, end := 0, len(nums)-1
@@ -35,7 +31,7 @@ func searchRange(nums []int, target int) []int {
 	return res
 }
 
-func main() {
+/* func main() {
 	a1 := []int{1, 2, 3, 4, 4, 4, 5, 6, 7, 8, 9, 10}
 	fmt.Println(searchRange(a1, 4))
 	fmt.Println(searchRange(a1, 5))
@@ -45,4 +41,4 @@ func main() {
 	a2 := []int{5, 7, 7, 8, 8, 10}
 	fmt.Println(searchRange(a2, 8))
 	fmt.Println(searchRange([]int{}, 9))
-}
+} */

medium/36.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 // 1 -> has this value
 var mDigit = map[byte]uint{
 	'.': 0x000,
@@ -77,7 +73,7 @@ func isValidSudoku(board [][]byte) bool {
 	return true
 }
 
-func main() {
+/* func main() {
 	b1 := [][]byte{
 		{'.', '8', '7', '6', '5', '4', '3', '2', '1'},
 		{'2', '.', '.', '.', '.', '.', '.', '.', '.'},
@@ -90,4 +86,4 @@ func main() {
 		{'9', '.', '.', '.', '.', '.', '.', '.', '.'},
 	}
 	fmt.Println(isValidSudoku(b1))
-}
+} */

medium/39.go

@@ -1,7 +1,6 @@
 package main
 
 import (
-	"fmt"
 	"sort"
 )
 
@@ -26,7 +25,7 @@ func combinationSum(candidates []int, target int) [][]int {
 	return res
 }
 
-func main() {
+/* func main() {
 	a1 := []int{2, 3, 6, 7}
 	fmt.Println(combinationSum(a1, 7))
 	a2 := []int{1, 2}
@@ -35,4 +34,4 @@ func main() {
 	fmt.Println(combinationSum(a3, 11))
 	a4 := []int{7, 3, 2}
 	fmt.Println(combinationSum(a4, 18))
-}
+} */

medium/40.go

@@ -1,7 +1,6 @@
 package main
 
 import (
-	"fmt"
 	"sort"
 )
 
@@ -29,7 +28,7 @@ func combinationSum2(candidates []int, target int) [][]int {
 	return res
 }
 
-func main() {
+/* func main() {
 	a1 := []int{10, 1, 2, 7, 6, 1, 5}
 	fmt.Println(combinationSum2(a1, 8))
-}
+} */

medium/43.go

@@ -117,6 +117,6 @@ func testMultiply(num1 string, num2 string) {
 	intSlice2Str(slice)
 }
 
-func main() {
+/* func main() {
 	testMultiply("782", "3908982")
-}
+} */

medium/46.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func nextPermutation(nums []int) {
 	if len(nums) < 2 {
 		return
@@ -50,7 +46,8 @@ func permute(nums []int) [][]int {
 	return res
 }
 
-func main() {
+/* func main() {
 	a1 := []int{1, 2, 3}
 	fmt.Println(permute(a1))
 }
+*/

medium/47.go

@@ -1,8 +1,6 @@
 package main
 
-import "fmt"
-
-func nextPermutation(nums []int) {
+/* func nextPermutation(nums []int) {
 	if len(nums) < 2 {
 		return
 	}
@@ -25,7 +23,7 @@ func nextPermutation(nums []int) {
 	for l, r := i+1, len(nums)-1; l < r; l, r = l+1, r-1 {
 		nums[l], nums[r] = nums[r], nums[l]
 	}
-}
+} */
 
 func isEqual(a, b []int) bool {
 	for i, v := range b {
@@ -56,7 +54,7 @@ func permuteUnique(nums []int) [][]int {
 	return res
 }
 
-func main() {
+/* func main() {
 	a1 := []int{1, 1, 2, 3}
 	fmt.Println(permuteUnique(a1))
-}
+} */

medium/48.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 /**
  * '1' 2 '3'  swap   '7' 2 '1'  next   7 '2' 1
  *  4  5  6  ----->   4  5  6  -----> '4' 5 '6' -> ...
@@ -18,7 +14,7 @@ func rotate(matrix [][]int) {
 	}
 }
 
-func main() {
+/* func main() {
 	m1 := [][]int{
 		{11, 22, 33, 44, 55},
 		{16, 27, 38, 49, 50},
@@ -37,4 +33,4 @@ func main() {
 	m3 := [][]int{}
 	rotate(m3)
 	fmt.Println(m3)
-}
+} */

medium/49.go

@@ -1,7 +1,6 @@
 package main
 
 import (
-	"fmt"
 	"sort"
 )
 
@@ -17,7 +16,7 @@ func groupAnagrams(strs []string) (res [][]string) {
 	m := map[string]int{}
 	for _, v := range strs {
 		runes := []rune(v)
-		sort.Sort([]int(runes))
+		sort.Sort(RuneSlice(runes))
 		if idx, ok := m[string(runes)]; !ok {
 			m[string(runes)] = len(m)
 			res = append(res, []string{v})
@@ -28,9 +27,9 @@ func groupAnagrams(strs []string) (res [][]string) {
 	return res
 }
 
-func main() {
+/* func main() {
 	a1 := []string{"eat", "tea", "tan", "ate", "nat", "bat"}
 	fmt.Println(groupAnagrams(a1))
 	a2 := []string{}
 	fmt.Println(groupAnagrams(a2))
-}
+} */

medium/5.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func longestPalindrome(s string) string {
 	n := len(s)
 	if n < 2 {
@@ -28,9 +24,9 @@ func longestPalindrome(s string) string {
 	return s[maxBeg : maxEnd+1]
 }
 
-func main() {
+/* func main() {
 	fmt.Println(longestPalindrome("ASDFDSAASBUGAYFUYFSDG"))
 	fmt.Println(longestPalindrome("A"))
 	fmt.Println(longestPalindrome(""))
 	fmt.Println(longestPalindrome("gigiudhfafhsaoifhoifaochasiofueosanfklf"))
-}
+} */

medium/50.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func myPow(x float64, n int) float64 {
 	if n < 0 {
 		n = -n
@@ -18,6 +14,6 @@ func myPow(x float64, n int) float64 {
 	return res
 }
 
-func main() {
+/* func main() {
 	fmt.Println(myPow(2.0, -10))
-}
+} */

medium/54.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func spiralOrder(matrix [][]int) (res []int) {
 	if len(matrix) == 0 {
 		return
@@ -50,7 +46,7 @@ func spiralOrder(matrix [][]int) (res []int) {
 	return
 }
 
-func main() {
+/* func main() {
 	m1 := [][]int{
 		{11, 22, 33, 44, 55},
 		{16, 27, 38, 49, 50},
@@ -72,4 +68,4 @@ func main() {
 		{11},
 	}
 	fmt.Println(spiralOrder(m3))
-}
+} */

medium/55.go

@@ -37,11 +37,11 @@ func canJump(nums []int) bool {
 	return true
 }
 
-func main() {
+/* func main() {
 	a1 := []int{2, 3, 1, 1, 4}
 	a2 := []int{3, 2, 1, 0, 4}
 	a3 := []int{0}
 	fmt.Println(canJump(a1))
 	fmt.Println(canJump(a2))
 	fmt.Println(canJump(a3))
-}
+} */

medium/56.go

@@ -1,7 +1,6 @@
 package main
 
 import (
-	"fmt"
 	"sort"
 )
 
@@ -92,12 +91,12 @@ func startValue(p, q *Interval) bool {
 	return p.Start < q.Start
 }
 
-func maxInt(x, y int) int {
+/* func maxInt(x, y int) int {
 	if x > y {
 		return x
 	}
 	return y
-}
+} */
 
 /**
  * Definition for an interval.
@@ -122,7 +121,7 @@ func merge(intervals []Interval) (res []Interval) {
 	return
 }
 
-func main() {
+/* func main() {
 	i1 := []Interval{{1, 3}, {2, 6}, {8, 10}, {15, 18}}
 	i2 := []Interval{}
 	i3 := []Interval{{1, 4}, {4, 5}, {5, 6}}
@@ -131,4 +130,4 @@ func main() {
 	fmt.Println(merge(i2))
 	fmt.Println(merge(i3))
 	fmt.Println(merge(i4))
-}
+} */

medium/59.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func generateMatrix(n int) [][]int {
 	res := make([][]int, n)
 	for i := range res {
@@ -38,10 +34,10 @@ func generateMatrix(n int) [][]int {
 	return res
 }
 
-func main() {
+/* func main() {
 	fmt.Println(generateMatrix(0))
 	fmt.Println(generateMatrix(1))
 	fmt.Println(generateMatrix(2))
 	fmt.Println(generateMatrix(3))
 	fmt.Println(generateMatrix(4))
-}
+} */

medium/6.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func convert(s string, numRows int) string {
 	n := len(s)
 	if n < 3 || numRows == 1 {
@@ -26,8 +22,8 @@ func convert(s string, numRows int) string {
 	return string(res)
 }
 
-func main() {
+/* func main() {
 	fmt.Println(convert("PAYPALISHIRING", 3))
 	fmt.Println(convert("ABCDE", 4))
 	fmt.Println("PAHNAPLSIIGYIR")
-}
+} */

medium/60.go

@@ -1,10 +1,6 @@
 package main
 
-import (
-	"fmt"
-)
-
-func nextPermutation(runes []rune) {
+func nextPermutationRune(runes []rune) {
 	if len(runes) < 2 {
 		return
 	}
@@ -31,7 +27,7 @@ func getPermutationOld(n int, k int) string {
 		res = append(res, rune('0'+i))
 	}
 	for i := 1; i < k; i++ {
-		nextPermutation(res)
+		nextPermutationRune(res)
 	}
 	return string(res)
 }
@@ -68,9 +64,9 @@ func fact(x int) int {
 	return x * fact(x-1)
 }
 
-func main() {
+/* func main() {
 	fmt.Println(getPermutationOld(4, 16))
 	fmt.Println(getPermutation(4, 16))
 	fmt.Println(getPermutation(1, 16))
 	fmt.Println(getPermutation(0, 16))
-}
+} */

medium/61.go

@@ -1,16 +1,12 @@
 package main
 
-import (
-	"fmt"
-)
-
 // ListNode ...
-type ListNode struct {
+/* type ListNode struct {
 	Val  int
 	Next *ListNode
-}
+} */
 
-func list2str(head *ListNode) string {
+/* func list2str(head *ListNode) string {
 	curr := head
 	str := make([]rune, 0)
 	for curr != nil {
@@ -18,7 +14,7 @@ func list2str(head *ListNode) string {
 		curr = curr.Next
 	}
 	return string(str)
-}
+} */
 
 /**
  * Definition for singly-linked list.
@@ -57,7 +53,7 @@ func rotateRight(head *ListNode, k int) *ListNode {
 	return dummy.Next
 }
 
-func main() {
+/* func main() {
 	l16 := ListNode{6, nil}
 	l15 := ListNode{5, &l16}
 	l14 := ListNode{4, &l15}
@@ -73,4 +69,4 @@ func main() {
 	fmt.Println(list2str(rotateRight(&l13, 5)))
 	fmt.Println(list2str(rotateRight(&l14, 6)))
 	fmt.Println(list2str(rotateRight(&l14, 7)))
-}
+} */

medium/62.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func uniquePaths(m int, n int) int {
 	if m == 1 || n == 1 {
 		return 1
@@ -24,8 +20,8 @@ func uniquePaths(m int, n int) int {
 	return grid[m-1][n-1]
 }
 
-func main() {
+/* func main() {
 	fmt.Println(uniquePaths(1, 1))
 	fmt.Println(uniquePaths(1, 2))
 	fmt.Println(uniquePaths(3, 7))
-}
+} */

medium/63.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func uniquePathsWithObstacles(obstacleGrid [][]int) int {
 	m, n := len(obstacleGrid), len(obstacleGrid[0])
 	// only one row/col
@@ -51,7 +47,7 @@ func uniquePathsWithObstacles(obstacleGrid [][]int) int {
 	return grid[m-1][n-1]
 }
 
-func main() {
+/* func main() {
 	o1 := [][]int{
 		{0, 0, 0},
 		{0, 1, 0},
@@ -64,4 +60,4 @@ func main() {
 		{0, 0, 0},
 	}
 	fmt.Println(uniquePathsWithObstacles(o2))
-}
+} */

medium/64.go

@@ -4,12 +4,12 @@ import (
 	"fmt"
 )
 
-func minInt(x, y int) int {
+/* func minInt(x, y int) int {
 	if x < y {
 		return x
 	}
 	return y
-}
+} */
 
 func minPathSumOld(grid [][]int) int {
 	m, n := len(grid), len(grid[0])
@@ -53,11 +53,11 @@ func minPathSum(grid [][]int) int {
 	return grid[m-1][n-1]
 }
 
-func main() {
+/* func main() {
 	g1 := [][]int{
 		{1, 3, 1},
 		{1, 5, 1},
 		{4, 2, 1},
 	}
 	fmt.Println(minPathSum(g1))
-}
+} */

medium/71.go

@@ -1,7 +1,6 @@
 package main
 
 import (
-	"fmt"
 	"strings"
 )
 
@@ -29,8 +28,8 @@ func simplifyPath(path string) string {
 	return strings.Join(res, "/")
 }
 
-func main() {
+/* func main() {
 	fmt.Println(simplifyPath("/c/"))
 	fmt.Println(simplifyPath("/a/./b/../../c/"))
 	fmt.Println(simplifyPath("/../../"))
-}
+} */

medium/73.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func setZeroes(matrix [][]int) {
 	// Can use type 'map[int]struct{}' instead,
 	// and insert empty struct like 'struct{}{}'.
@@ -26,7 +22,7 @@ func setZeroes(matrix [][]int) {
 	}
 }
 
-func main() {
+/* func main() {
 	m1 := [][]int{
 		{0, 2, 4, 6},
 		{1, 3, 4, 5},
@@ -36,3 +32,4 @@ func main() {
 	setZeroes(m1)
 	fmt.Println(m1)
 }
+*/

medium/74.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func searchMatrix(matrix [][]int, target int) bool {
 	if len(matrix) == 0 || len(matrix[0]) == 0 {
 		return false
@@ -24,7 +20,7 @@ func searchMatrix(matrix [][]int, target int) bool {
 	return false
 }
 
-func main() {
+/* func main() {
 	m1 := [][]int{
 		{1, 3, 6, 8},
 		{9, 13, 53, 76},
@@ -34,4 +30,4 @@ func main() {
 	fmt.Println(searchMatrix(m1, 987))
 	fmt.Println(searchMatrix(m1, 97))
 	fmt.Println(searchMatrix(m1, 1))
-}
+} */

medium/75.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 // ?? check the best solution the next time
 func sortColors(nums []int) {
 	mCnt := [3]int{}
@@ -18,9 +14,9 @@ func sortColors(nums []int) {
 	}
 }
 
-func main() {
+/* func main() {
 	c1 := []int{0, 1, 1, 2, 0, 0, 1, 2, 1}
 	sortColors(c1)
 	fmt.Println(c1)
 	sortColors([]int{})
-}
+} */

medium/77.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func combinIter(n int, k int, last []int, res *[][]int) {
 	solution := make([]int, len(last))
 	copy(solution, last)
@@ -28,7 +24,7 @@ func combineOld(n int, k int) (res [][]int) {
 }
 
 // a cleaner way of recursion
-func combine(n int, k int) (res [][]int) {
+/* func combine(n int, k int) (res [][]int) {
 	// Cnn or C0n
 	if n == k || k == 0 {
 		row := make([]int, k)
@@ -44,10 +40,11 @@ func combine(n int, k int) (res [][]int) {
 	}
 	res = append(res, combine(n-1, k)...)
 	return
-}
+} */
 
-func main() {
+/* func main() {
 	fmt.Println(combine(4, 2))
 	fmt.Println(combine(5, 4))
 	fmt.Println(combine(1, 1))
 }
+*/

medium/78.go

@@ -1,9 +1,5 @@
 package main
 
-import (
-	"fmt"
-)
-
 func combine(nums []int, k int) (res [][]int) {
 	n := len(nums)
 	if n == k || k == 0 {
@@ -29,7 +25,7 @@ func subsets(nums []int) (res [][]int) {
 	return
 }
 
-func main() {
+/* func main() {
 	a1 := []int{1, 2, 3}
 	fmt.Println(subsets(a1))
-}
+} */

medium/79.go

@@ -1,12 +1,10 @@
 package main
 
-import "fmt"
-
 func exist(board [][]byte, word string) bool {
 	return false
 }
 
-func main() {
+/* func main() {
 	b1 := [][]byte{
 		{'A', 'B', 'C', 'E'},
 		{'S', 'F', 'C', 'S'},
@@ -16,4 +14,4 @@ func main() {
 	fmt.Println(exist(b1, "SEE"))
 	fmt.Println(exist(b1, "ABCB"))
 	fmt.Println(exist(b1, "FSADEESCCBA"))
-}
+} */

medium/8.go

@@ -72,7 +72,7 @@ func testMyAtoi(str string) {
 	fmt.Printf("\"%s\" -> %d\n", str, myAtoi(str))
 }
 
-func main() {
+/* func main() {
 	testMyAtoi("")
 	testMyAtoi("       00000000000000000000           ")
 	testMyAtoi("+")
@@ -84,4 +84,4 @@ func main() {
 	testMyAtoi("   -2.1    ")
 	testMyAtoi("   - 0.1    ")
 	testMyAtoi("   num 0.1    ")
-}
+} */