Fix BinarySearch.go style by gofmt (egonSchiele#80)

linehk · egonSchiele · commit e206a1315392 · 2018-07-25T11:01:40.000-07:00
* Fix BinarySearch.go style by gofmt

* Fix longest_common_subsequence.go style by gofmt
diff --git a/01_introduction_to_algorithms/Golang/BinarySearch.go b/01_introduction_to_algorithms/Golang/BinarySearch.go
@@ -4,24 +4,22 @@ import "fmt"
 
 func checkBin(list []int, i int) bool {
 	low := 0
-	high := len(list) -1
+	high := len(list) - 1
 	for low <= high {
-		mid:= (low+high)/2
-		if list[mid] == i{
+		mid := (low + high) / 2
+		if list[mid] == i {
 			return true
 		}
-		if list[mid] < i{
-			low = mid+1
-		}else {
-			high = mid -1
+		if list[mid] < i {
+			low = mid + 1
+		} else {
+			high = mid - 1
 		}
 	}
 	return false
 }
 
 func main() {
-	fmt.Println(checkBin([]int{1, 2, 3, 4, 5}, 1)) // true
+	fmt.Println(checkBin([]int{1, 2, 3, 4, 5}, 1))  // true
 	fmt.Println(checkBin([]int{1, 2, 3, 4, 5}, -1)) //false
 }
-
-
diff --git a/09_dynamic_programming/golang/01_longest_common_subsequence.go b/09_dynamic_programming/golang/01_longest_common_subsequence.go
@@ -1,10 +1,11 @@
 package main
+
 import "fmt"
 
-func main(){
+func main() {
 	if word_a[i] == word_b[j] {
-		cell[i][j] = cell[i-1][j-1]+1
-	}else{
+		cell[i][j] = cell[i-1][j-1] + 1
+	} else {
 		cell[i][j] = max(cell[i-1][j], cell[i][j-1])
 	}
 }
