format project

Author: kakugirai

src/3sum/solution_test.go

@@ -29,4 +29,3 @@ func Test_threeSum(t *testing.T) {
 		})
 	}
 }
-

src/add-binary/solution_test.go

@@ -26,4 +26,3 @@ func Test_addBinary(t *testing.T) {
 		})
 	}
 }
-

src/backspace-string-compare/solution_test.go

@@ -28,4 +28,3 @@ func Test_backspaceCompare(t *testing.T) {
 		})
 	}
 }
-

src/binary-tree-postorder-traversal/solution.go

@@ -56,5 +56,5 @@ func main() {
 				&TreeNode{8, nil, nil},
 				&TreeNode{9, nil, nil}},
 			nil}}
-	fmt.Printf("%#v",postorderTraversal(tree))
+	fmt.Printf("%#v", postorderTraversal(tree))
 }

src/binary-tree-preorder-traversal/solution_test.go

@@ -40,4 +40,3 @@ func Test_preorderTraversal(t *testing.T) {
 		})
 	}
 }
-

src/convert-bst-to-greater-tree/solution_test.go

@@ -28,4 +28,3 @@ func Test_convertBST(t *testing.T) {
 		})
 	}
 }
-

src/edit-distance/solution_test.go

@@ -26,4 +26,3 @@ func Test_minDistance(t *testing.T) {
 		})
 	}
 }
-

src/find-the-difference/solution_test.go

@@ -28,4 +28,3 @@ func Test_findTheDifference(t *testing.T) {
 		})
 	}
 }
-

src/first-unique-character-in-a-string/solution_test.go

@@ -27,5 +27,3 @@ func Test_firstUniqChar(t *testing.T) {
 		})
 	}
 }
-
-

src/fizz-buzz/solution_test.go

@@ -28,4 +28,3 @@ func Test_fizzBuzz(t *testing.T) {
 		})
 	}
 }
-

src/flatten-binary-tree-to-linked-list/solution_test.go

@@ -31,4 +31,3 @@ func Test_flatten(t *testing.T) {
 		})
 	}
 }
-

src/implement-queue-using-stacks/solution_test.go

@@ -47,7 +47,6 @@ func Test_stack_Empty(t *testing.T) {
 	}
 }
 
-
 func Test_stack_Peek(t *testing.T) {
 	tests := []struct {
 		name string
@@ -76,10 +75,10 @@ func TestConstructor(t *testing.T) {
 	}{
 		{
 			"1",
-			 MyQueue{
-			 	new(stack),
-			 	new(stack),
-			 },
+			MyQueue{
+				new(stack),
+				new(stack),
+			},
 		},
 	}
 	for _, tt := range tests {
@@ -154,4 +153,3 @@ func TestMyQueue_Empty(t *testing.T) {
 		})
 	}
 }
-

src/jewels-and-stones/solution_test.go

@@ -28,4 +28,3 @@ func Test_numJewelsInStones(t *testing.T) {
 		})
 	}
 }
-

src/kth-largest-element-in-an-array/solution_test.go

@@ -4,7 +4,6 @@ import (
 	"testing"
 )
 
-
 func Test_findKthLargest(t *testing.T) {
 	type args struct {
 		nums []int
@@ -31,4 +30,3 @@ func Test_findKthLargest(t *testing.T) {
 		})
 	}
 }
-

src/letter-combinations-of-a-phone-number/solution_test.go

@@ -28,4 +28,3 @@ func Test_letterCombinations(t *testing.T) {
 		})
 	}
 }
-

src/lru-cache/solution.go

@@ -8,7 +8,7 @@ import (
 // LRUCache contains a map and a doubly linked list
 type LRUCache struct {
 	cap int                   // capacity
-	l   *list	.List            // doubly linked list
+	l   *list.List            // doubly linked list
 	m   map[int]*list.Element // hash table for checking if list node exists
 }
 
@@ -72,8 +72,8 @@ func (c *LRUCache) Put(key int, value int) {
 }
 
 func main() {
-	obj := Constructor(2)   // nil
-	obj.Put(1, 10)          // nil, linked list: [1:10]
+	obj := Constructor(2) // nil
+	obj.Put(1, 10)        // nil, linked list: [1:10]
 	fmt.Println(obj.l)
 	fmt.Println(obj.Get(1)) // -1, linked list: [4:40, 3:30]
 	obj.Put(2, 20)          // nil, linked list: [2:20, 1:10]

src/path-sum/solution_test.go

@@ -28,4 +28,3 @@ func Test_hasPathSum(t *testing.T) {
 		})
 	}
 }
-

src/power-of-three/solution_test.go

@@ -24,4 +24,4 @@ func Test_isPowerOfThree(t *testing.T) {
 			}
 		})
 	}
-}
+}

src/reverse-vowels-of-a-string/solution_test.go

@@ -13,7 +13,7 @@ func Test_reverseVowels(t *testing.T) {
 	}{
 		{
 			"1",
-			args{s:"lEetcode"},
+			args{s: "lEetcode"},
 			"leotcedE",
 		},
 	}
@@ -24,4 +24,4 @@ func Test_reverseVowels(t *testing.T) {
 			}
 		})
 	}
-}
+}

src/sudoku-solver/solution.go

@@ -13,9 +13,8 @@ func solve(board *[][]byte) bool {
 						(*board)[i][j] = byte(k + '0')
 						if solve(board) {
 							return true
-						} else {
-							(*board)[i][j] = '.'
 						}
+						(*board)[i][j] = '.'
 					}
 				}
 				return false