Fix BinarySearch.go style by gofmt (#80)

* Fix BinarySearch.go style by gofmt

* Fix longest_common_subsequence.go style by gofmt
This commit is contained in:
sulinehk
2018-07-26 02:01:40 +08:00
committed by Aditya Bhargava
parent fb0d9dccfd
commit e206a13153
2 changed files with 12 additions and 13 deletions

View File

@@ -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])
}
}