-
Notifications
You must be signed in to change notification settings - Fork 21
/
WordSearch.js
103 lines (90 loc) 路 2.26 KB
/
WordSearch.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
/**
* Given a 2D board and a word, find if the word exists in the grid.
*
* The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring.
* The same letter cell may not be used more than once.
*
* For example,
* Given board =
*
* [
* ['A','B','C','E'],
* ['S','F','C','S'],
* ['A','D','E','E']
* ]
* word = "ABCCED", -> returns true,
* word = "SEE", -> returns true,
* word = "ABCB", -> returns false.
*
* Accepted.
*/
/**
* @param {char[][]} board
* @param {string} word
* @return {boolean}
*/
let exist = function (board, word) {
if (board == null || board.length === 0 || board[0].length === 0) {
return false;
}
for (let i = 0; i < board.length; i++) {
for (let j = 0; j < board[0].length; j++) {
if (search(board, i, j, word, 0)) {
return true;
}
}
}
return false;
};
/**
* @param {char[][]} board
* @param {number} i
* @param {number} j
* @param {string} word
* @param {number} index
* @returns {boolean}
*/
let search = function (board, i, j, word, index) {
if (index >= word.length) {
return true;
}
if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j].charCodeAt(0) !== word.charAt(index).charCodeAt(0)) {
return false;
}
board[i][j] = String.fromCharCode(board[i][j].charCodeAt(0) ^ 255);
let res = search(board, i - 1, j, word, index + 1)
|| search(board, i + 1, j, word, index + 1)
|| search(board, i, j - 1, word, index + 1)
|| search(board, i, j + 1, word, index + 1);
board[i][j] = String.fromCharCode(board[i][j].charCodeAt(0) ^ 255);
return res;
};
if (!exist([], "AB")) {
console.log("pass")
} else {
console.error("failed")
}
if (!exist(null, "AB")) {
console.log("pass")
} else {
console.error("failed")
}
let chars = [
['A', 'B', 'C', 'E'],
['S', 'F', 'C', 'S'],
['A', 'D', 'E', 'E']];
if (exist(chars, "ABCCED")) {
console.log("pass")
} else {
console.error("failed")
}
if (exist(chars, "SEE")) {
console.log("pass")
} else {
console.error("failed")
}
if (!exist(chars, "ABCB")) {
console.log("pass")
} else {
console.error("failed")
}