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:
committed by
Aditya Bhargava
parent
fb0d9dccfd
commit
e206a13153
@@ -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])
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user