Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: add solutions to lcp problem: No.79 #1219

Merged
merged 1 commit into from
Jul 16, 2023
Merged

feat: add solutions to lcp problem: No.79 #1219

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
185 changes: 184 additions & 1 deletion lcp/LCP 79. 提取咒文/README.md
View file
Original file line number Diff line number Diff line change
@@ -42,22 +42,205 @@

<!-- 这里可写通用的实现逻辑 -->

**方法一：BFS**

时间复杂度 $O(m \times n \times l)$，空间复杂度 $O(m \times n \times l)$。

<!-- tabs:start -->

### **Python3**

<!-- 这里可写当前语言的特殊实现逻辑 -->

```python

class Solution:
def extractMantra(self, matrix: List[str], mantra: str) -> int:
m, n = len(matrix), len(matrix[0])
q = deque([(0, 0, 0)])
vis = {q[0]}
dirs = (-1, 0, 1, 0, -1)
ans = 0
while q:
for _ in range(len(q)):
i, j, k = q.popleft()
if k == len(mantra):
return ans
if matrix[i][j] == mantra[k]:
t = (i, j, k + 1)
if t not in vis:
vis.add(t)
q.append(t)
else:
for a, b in pairwise(dirs):
x, y = i + a, j + b
if 0 <= x < m and 0 <= y < n:
t = (x, y, k)
if t not in vis:
vis.add(t)
q.append(t)
ans += 1
return -1
```

### **Java**

<!-- 这里可写当前语言的特殊实现逻辑 -->

```java
class Solution {
public int extractMantra(String[] matrix, String mantra) {
int m = matrix.length, n = matrix[0].length();
int l = mantra.length();
Deque<int[]> q = new ArrayDeque<>();
q.offer(new int[] {0, 0, 0});
boolean[][][] vis = new boolean[m][n][l + 1];
vis[0][0][0] = true;
int[] dirs = {-1, 0, 1, 0, -1};
int ans = 0;
for (; !q.isEmpty(); ++ans) {
for (int size = q.size(); size > 0; --size) {
var p = q.poll();
int i = p[0], j = p[1], k = p[2];
if (k == l) {
return ans;
}
if (matrix[i].charAt(j) == mantra.charAt(k) && !vis[i][j][k + 1]) {
vis[i][j][k + 1] = true;
q.offer(new int[] {i, j, k + 1});
} else {
for (int c = 0; c < 4; ++c) {
int x = i + dirs[c], y = j + dirs[c + 1];
if (x >= 0 && x < m && y >= 0 && y < n && !vis[x][y][k]) {
vis[x][y][k] = true;
q.offer(new int[] {x, y, k});
}
}
}
}
}
return -1;
}
}
```

### **C++**

```cpp
class Solution {
public:
int extractMantra(vector<string>& matrix, string mantra) {
int m = matrix.size(), n = matrix[0].size();
int l = mantra.size();
queue<tuple<int, int, int>> q;
q.push({0, 0, 0});
bool vis[m][n][l + 1];
memset(vis, 0, sizeof(vis));
int dirs[5] = {-1, 0, 1, 0, -1};
int ans = 0;
for (; q.size(); ++ans) {
for (int size = q.size(); size; --size) {
auto [i, j, k] = q.front();
q.pop();
if (k == l) {
return ans;
}
if (matrix[i][j] == mantra[k] && !vis[i][j][k + 1]) {
vis[i][j][k + 1] = true;
q.push({i, j, k + 1});
} else {
for (int c = 0; c < 4; ++c) {
int x = i + dirs[c], y = j + dirs[c + 1];
if (x >= 0 && x < m && y >= 0 && y < n && !vis[x][y][k]) {
vis[x][y][k] = true;
q.push({x, y, k});
}
}
}
}
}
return -1;
}
};
```

### **Go**

```go
func extractMantra(matrix []string, mantra string) (ans int) {
m, n, l := len(matrix), len(matrix[0]), len(mantra)
q := [][3]int{[3]int{0, 0, 0}}
vis := make([][][]bool, m)
for i := range vis {
vis[i] = make([][]bool, n)
for j := range vis[i] {
vis[i][j] = make([]bool, l+1)
}
}
vis[0][0][0] = true
dirs := [5]int{-1, 0, 1, 0, -1}
for ; len(q) > 0; ans++ {
for size := len(q); size > 0; size-- {
p := q[0]
q = q[1:]
i, j, k := p[0], p[1], p[2]
if k == l {
return ans
}
if matrix[i][j] == mantra[k] && !vis[i][j][k+1] {
vis[i][j][k+1] = true
q = append(q, [3]int{i, j, k + 1})
} else {
for c := 0; c < 4; c++ {
x, y := i+dirs[c], j+dirs[c+1]
if x >= 0 && x < m && y >= 0 && y < n && !vis[x][y][k] {
vis[x][y][k] = true
q = append(q, [3]int{x, y, k})
}
}
}
}
}
return -1
}
```

### **TypeScript**

```ts
function extractMantra(matrix: string[], mantra: string): number {
const [m, n, l] = [matrix.length, matrix[0].length, mantra.length];
const q: number[][] = [[0, 0, 0]];
const vis: boolean[][][] = Array(m)
.fill(0)
.map(() =>
Array(n)
.fill(0)
.map(() => Array(l + 1).fill(false)),
);
const dirs: number[] = [-1, 0, 1, 0, -1];
let ans = 0;
for (; q.length > 0; ++ans) {
for (let size = q.length; size > 0; --size) {
const [i, j, k] = q.shift()!;
if (k === l) {
return ans;
}
if (matrix[i][j] === mantra[k] && !vis[i][j][k + 1]) {
vis[i][j][k + 1] = true;
q.push([i, j, k + 1]);
} else {
for (let c = 0; c < 4; ++c) {
const [x, y] = [i + dirs[c], j + dirs[c + 1]];
if (x >= 0 && x < m && y >= 0 && y < n && !vis[x][y][k]) {
vis[x][y][k] = true;
q.push([x, y, k]);
}
}
}
}
}
return -1;
}
```

### **...**
35 changes: 35 additions & 0 deletions lcp/LCP 79. 提取咒文/Solution.cpp
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
class Solution {
public:
int extractMantra(vector<string>& matrix, string mantra) {
int m = matrix.size(), n = matrix[0].size();
int l = mantra.size();
queue<tuple<int, int, int>> q;
q.push({0, 0, 0});
bool vis[m][n][l + 1];
memset(vis, 0, sizeof(vis));
int dirs[5] = {-1, 0, 1, 0, -1};
int ans = 0;
for (; q.size(); ++ans) {
for (int size = q.size(); size; --size) {
auto [i, j, k] = q.front();
q.pop();
if (k == l) {
return ans;
}
if (matrix[i][j] == mantra[k] && !vis[i][j][k + 1]) {
vis[i][j][k + 1] = true;
q.push({i, j, k + 1});
} else {
for (int c = 0; c < 4; ++c) {
int x = i + dirs[c], y = j + dirs[c + 1];
if (x >= 0 && x < m && y >= 0 && y < n && !vis[x][y][k]) {
vis[x][y][k] = true;
q.push({x, y, k});
}
}
}
}
}
return -1;
}
};
36 changes: 36 additions & 0 deletions lcp/LCP 79. 提取咒文/Solution.go
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
func extractMantra(matrix []string, mantra string) (ans int) {
m, n, l := len(matrix), len(matrix[0]), len(mantra)
q := [][3]int{[3]int{0, 0, 0}}
vis := make([][][]bool, m)
for i := range vis {
vis[i] = make([][]bool, n)
for j := range vis[i] {
vis[i][j] = make([]bool, l+1)
}
}
vis[0][0][0] = true
dirs := [5]int{-1, 0, 1, 0, -1}
for ; len(q) > 0; ans++ {
for size := len(q); size > 0; size-- {
p := q[0]
q = q[1:]
i, j, k := p[0], p[1], p[2]
if k == l {
return ans
}
if matrix[i][j] == mantra[k] && !vis[i][j][k+1] {
vis[i][j][k+1] = true
q = append(q, [3]int{i, j, k + 1})
} else {
for c := 0; c < 4; c++ {
x, y := i+dirs[c], j+dirs[c+1]
if x >= 0 && x < m && y >= 0 && y < n && !vis[x][y][k] {
vis[x][y][k] = true
q = append(q, [3]int{x, y, k})
}
}
}
}
}
return -1
}
34 changes: 34 additions & 0 deletions lcp/LCP 79. 提取咒文/Solution.java
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
class Solution {
public int extractMantra(String[] matrix, String mantra) {
int m = matrix.length, n = matrix[0].length();
int l = mantra.length();
Deque<int[]> q = new ArrayDeque<>();
q.offer(new int[] {0, 0, 0});
boolean[][][] vis = new boolean[m][n][l + 1];
vis[0][0][0] = true;
int[] dirs = {-1, 0, 1, 0, -1};
int ans = 0;
for (; !q.isEmpty(); ++ans) {
for (int size = q.size(); size > 0; --size) {
var p = q.poll();
int i = p[0], j = p[1], k = p[2];
if (k == l) {
return ans;
}
if (matrix[i].charAt(j) == mantra.charAt(k) && !vis[i][j][k + 1]) {
vis[i][j][k + 1] = true;
q.offer(new int[] {i, j, k + 1});
} else {
for (int c = 0; c < 4; ++c) {
int x = i + dirs[c], y = j + dirs[c + 1];
if (x >= 0 && x < m && y >= 0 && y < n && !vis[x][y][k]) {
vis[x][y][k] = true;
q.offer(new int[] {x, y, k});
}
}
}
}
}
return -1;
}
}
27 changes: 27 additions & 0 deletions lcp/LCP 79. 提取咒文/Solution.py
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
class Solution:
def extractMantra(self, matrix: List[str], mantra: str) -> int:
m, n = len(matrix), len(matrix[0])
q = deque([(0, 0, 0)])
vis = {q[0]}
dirs = (-1, 0, 1, 0, -1)
ans = 0
while q:
for _ in range(len(q)):
i, j, k = q.popleft()
if k == len(mantra):
return ans
if matrix[i][j] == mantra[k]:
t = (i, j, k + 1)
if t not in vis:
vis.add(t)
q.append(t)
else:
for a, b in pairwise(dirs):
x, y = i + a, j + b
if 0 <= x < m and 0 <= y < n:
t = (x, y, k)
if t not in vis:
vis.add(t)
q.append(t)
ans += 1
return -1
34 changes: 34 additions & 0 deletions lcp/LCP 79. 提取咒文/Solution.ts
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
function extractMantra(matrix: string[], mantra: string): number {
const [m, n, l] = [matrix.length, matrix[0].length, mantra.length];
const q: number[][] = [[0, 0, 0]];
const vis: boolean[][][] = Array(m)
.fill(0)
.map(() =>
Array(n)
.fill(0)
.map(() => Array(l + 1).fill(false)),
);
const dirs: number[] = [-1, 0, 1, 0, -1];
let ans = 0;
for (; q.length > 0; ++ans) {
for (let size = q.length; size > 0; --size) {
const [i, j, k] = q.shift()!;
if (k === l) {
return ans;
}
if (matrix[i][j] === mantra[k] && !vis[i][j][k + 1]) {
vis[i][j][k + 1] = true;
q.push([i, j, k + 1]);
} else {
for (let c = 0; c < 4; ++c) {
const [x, y] = [i + dirs[c], j + dirs[c + 1]];
if (x >= 0 && x < m && y >= 0 && y < n && !vis[x][y][k]) {
vis[x][y][k] = true;
q.push([x, y, k]);
}
}
}
}
}
return -1;
}
2 changes: 1 addition & 1 deletion solution/0800-0899/0834.Sum of Distances in Tree/README.md
View file
Original file line number Diff line number Diff line change
@@ -257,7 +257,7 @@ function sumOfDistancesInTree(n: number, edges: number[][]): number[] {
const dfs2 = (i: number, fa: number, t: number) => {
ans[i] = t;
for (const j of g[i]) {
if (j != fa) {
if (j !== fa) {
dfs2(j, i, t - size[j] + n - size[j]);
}
}
2 changes: 1 addition & 1 deletion solution/0800-0899/0834.Sum of Distances in Tree/README_EN.md
View file
Original file line number Diff line number Diff line change
@@ -234,7 +234,7 @@ function sumOfDistancesInTree(n: number, edges: number[][]): number[] {
const dfs2 = (i: number, fa: number, t: number) => {
ans[i] = t;
for (const j of g[i]) {
if (j != fa) {
if (j !== fa) {
dfs2(j, i, t - size[j] + n - size[j]);
}
}
Loading