forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.cpp
33 lines (33 loc) · 1.29 KB
/
Solution.cpp
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
class Solution {
public:
bool placeWordInCrossword(vector<vector<char>>& board, string word) {
int m = board.size(), n = board[0].size();
int k = word.size();
auto check = [&](int i, int j, int a, int b) {
int x = i + a * k, y = j + b * k;
if (x >= 0 && x < m && y >= 0 && y < n && board[x][y] != '#') {
return false;
}
for (char& c : word) {
if (i < 0 || i >= m || j < 0 || j >= n || (board[i][j] != ' ' && board[i][j] != c)) {
return false;
}
i += a;
j += b;
}
return true;
};
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
bool leftToRight = (j == 0 || board[i][j - 1] == '#') && check(i, j, 0, 1);
bool rightToLeft = (j == n - 1 || board[i][j + 1] == '#') && check(i, j, 0, -1);
bool upToDown = (i == 0 || board[i - 1][j] == '#') && check(i, j, 1, 0);
bool downToUp = (i == m - 1 || board[i + 1][j] == '#') && check(i, j, -1, 0);
if (leftToRight || rightToLeft || upToDown || downToUp) {
return true;
}
}
}
return false;
}
};