word_search

Author: hitzzc

README.md

@@ -68,6 +68,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [76. minimum window substring](https://github.com/hitzzc/go-leetcode/tree/master/minimum_window_substring)
 #### [77. combinations](https://github.com/hitzzc/go-leetcode/tree/master/combinations)
 #### [78. subsets](https://github.com/hitzzc/go-leetcode/tree/master/subsets)
+#### [79. word search(not solved)](https://github.com/hitzzc/go-leetcode/tree/master/word_search)
 
 
 

word_search/word_search.go

@@ -0,0 +1,24 @@
+package word_search
+
+func exist(board [][]byte, word string) bool {
+	words := []byte(word)
+	if len(words) == 0 || len(board) == 0 || len(board[0]) == 0 {
+		return true
+	}
+
+	mask := make([][]bool, len(board))
+	for i := 0; i < len(board); i++ {
+		mask[i] = make([]int, len(board[i]))
+	}
+
+	for i := 0; i < len(board); i++ {
+		for j := 0; j < len(board[i]); j++ {
+
+		}
+	}
+	return false
+}
+
+func getExist(board [][]byte, words []byte, index int, row int, col int, mask [][]int) {
+
+}

word_search/word_search_test.go

@@ -0,0 +1,14 @@
+package word_search
+
+import (
+	"testing"
+)
+
+func TestExist(t *testing.T) {
+	board := [][]byte{
+		[]byte("abce"),
+		[]byte("sfcs"),
+		[]byte("adee"),
+	}
+	println(exist(board, "abceseeefs"))
+}