Merge pull request #276 from hzliangbin/master

feat: add golang solution for lcof problem 12 13 14I

Author: yanglbme

lcof/面试题12. 矩阵中的路径/README.md

@@ -138,7 +138,51 @@ var exist = function(board, word) {
 };
 ```
 
+### Go
+
+```go
+func exist(board [][]byte, word string) bool {
+    if len(board) == 0 {
+        return false
+    }
+    //标记数组
+    isVisited := make([][]bool,len(board))
+    for i := 0; i < len(board); i++ {
+        isVisited[i] = make([]bool, len(board[0]))
+    }
+    for i := 0; i < len(board); i++ {
+        for j := 0; j < len(board[0]); j++ {
+            if board[i][j] == word[0] {
+                if bfs(board,i,j,isVisited,word,0) {
+                    return true
+                }
+            }
+        }
+    }
+    return false
+}
+
+func bfs(board [][]byte, i,j int, isVisited [][]bool, word string, index int) bool {
+    if index == len(word) {
+        return true
+    }
+    if i < 0 || j < 0 || i == len(board) || j == len(board[0]) || isVisited[i][j] || board[i][j] != word[index] {
+        return false
+    }
+    isVisited[i][j] = true
+    res := bfs(board, i+1, j, isVisited, word, index+1) ||
+        bfs(board, i, j+1, isVisited, word, index+1) ||
+        bfs(board, i-1, j, isVisited, word, index+1) ||
+        bfs(board, i, j-1, isVisited, word, index+1)
+    isVisited[i][j] = false
+    return res
+}
+```
+
+
+
 ### ...
+
 ```
 
 ```

lcof/面试题12. 矩阵中的路径/Solution.go

@@ -0,0 +1,36 @@
+func exist(board [][]byte, word string) bool {
+    if len(board) == 0 {
+        return false
+    }
+    //标记数组
+    isVisited := make([][]bool,len(board))
+    for i := 0; i < len(board); i++ {
+        isVisited[i] = make([]bool, len(board[0]))
+    }
+    for i := 0; i < len(board); i++ {
+        for j := 0; j < len(board[0]); j++ {
+            if board[i][j] == word[0] {
+                if bfs(board,i,j,isVisited,word,0) {
+                    return true
+                }
+            }
+        }
+    }
+    return false
+}
+
+func bfs(board [][]byte, i,j int, isVisited [][]bool, word string, index int) bool {
+    if index == len(word) {
+        return true
+    }
+    if i < 0 || j < 0 || i == len(board) || j == len(board[0]) || isVisited[i][j] || board[i][j] != word[index] {
+        return false
+    }
+    isVisited[i][j] = true
+    res := bfs(board, i+1, j, isVisited, word, index+1) ||
+        bfs(board, i, j+1, isVisited, word, index+1) ||
+        bfs(board, i-1, j, isVisited, word, index+1) ||
+        bfs(board, i, j-1, isVisited, word, index+1)
+    isVisited[i][j] = false
+    return res
+}

lcof/面试题13. 机器人的运动范围/README.md

@@ -127,7 +127,31 @@ var movingCount = function(m, n, k) {
 };
 ```
 
+### Go
+
+```go
+func movingCount(m int, n int, k int) int {
+    var visited [][]bool
+    visited = make([][]bool,m)
+    for i:=0; i< m; i++ {
+        visited[i] = make([]bool,n)
+    }
+    return dfs(0,0,m,n,k,visited)
+}
+
+func dfs(x,y,m,n,k int, visited [][]bool) int {
+    if x >= m || y >=n || visited[x][y] || (x%10+x/10+y%10+y/10) >k {
+        return 0
+    }
+    visited[x][y] = true
+    return 1+ dfs(x+1,y,m,n,k,visited)+dfs(x,y+1,m,n,k,visited)
+}
+```
+
+
+
 ### ...
+
 ```
 
 ```

lcof/面试题13. 机器人的运动范围/Solution.go

@@ -0,0 +1,16 @@
+func movingCount(m int, n int, k int) int {
+    var visited [][]bool
+    visited = make([][]bool,m)
+    for i:=0; i< m; i++ {
+        visited[i] = make([]bool,n)
+    }
+    return dfs(0,0,m,n,k,visited)
+}
+
+func dfs(x,y,m,n,k int, visited [][]bool) int {
+    if x >= m || y >=n || visited[x][y] || (x%10+x/10+y%10+y/10) >k {
+        return 0
+    }
+    visited[x][y] = true
+    return 1+ dfs(x+1,y,m,n,k,visited)+dfs(x,y+1,m,n,k,visited)
+}

lcof/面试题14- I. 剪绳子/README.md

@@ -82,7 +82,28 @@ var cuttingRope = function(n) {
 };
 ```
 
+
+
+### Go
+
+```go
+func cuttingRope(n int) int {
+    if n <= 3 {
+        return n-1
+    }
+    sum := 1
+    for n > 4 {
+        sum *= 3
+        n -= 3
+    }
+    return sum*n
+}
+```
+
+
+
 ### ...
+
 ```
 
 ```

lcof/面试题14- I. 剪绳子/Solution.go

@@ -0,0 +1,11 @@
+func cuttingRope(n int) int {
+    if n <= 3 {
+        return n-1
+    }
+    sum := 1
+    for n > 4 {
+        sum *= 3
+        n -= 3
+    }
+    return sum*n
+}