Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018 2019-10-17 02:23:07 +08:00
parent dec684a9a6
commit 85f472266d
2 changed files with 6 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
docs/notes/Leetcode 题解 - 搜索.md
View File

@ -503,13 +503,12 @@ Return:
左边和上边是太平洋，右边和下边是大西洋，内部的数字代表海拔，海拔高的地方的水能够流到低的地方，求解水能够流到太平洋和大西洋的所有位置。 左边和上边是太平洋，右边和下边是大西洋，内部的数字代表海拔，海拔高的地方的水能够流到低的地方，求解水能够流到太平洋和大西洋的所有位置。
```java ```java
private int m, n; private int m, n;
private int[][] matrix; private int[][] matrix;
private int[][] direction = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; private int[][] direction = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
public List<int[]> pacificAtlantic(int[][] matrix) { public List<List<Integer>> pacificAtlantic(int[][] matrix) {
List<int[]> ret = new ArrayList<>(); List<List<Integer>> ret = new ArrayList<>();
if (matrix == null || matrix.length == 0) { if (matrix == null || matrix.length == 0) {
return ret; return ret;
} }
@ -532,7 +531,7 @@ public List<int[]> pacificAtlantic(int[][] matrix) {
for (int i = 0; i < m; i++) { for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) { for (int j = 0; j < n; j++) {
if (canReachP[i][j] && canReachA[i][j]) { if (canReachP[i][j] && canReachA[i][j]) {
ret.add(new int[]{i, j}); ret.add(Arrays.asList(i, j));
} }
} }
} }

7
notes/Leetcode 题解 - 搜索.md
View File

@ -503,13 +503,12 @@ Return:
左边和上边是太平洋，右边和下边是大西洋，内部的数字代表海拔，海拔高的地方的水能够流到低的地方，求解水能够流到太平洋和大西洋的所有位置。 左边和上边是太平洋，右边和下边是大西洋，内部的数字代表海拔，海拔高的地方的水能够流到低的地方，求解水能够流到太平洋和大西洋的所有位置。
```java ```java
private int m, n; private int m, n;
private int[][] matrix; private int[][] matrix;
private int[][] direction = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; private int[][] direction = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
public List<int[]> pacificAtlantic(int[][] matrix) { public List<List<Integer>> pacificAtlantic(int[][] matrix) {
List<int[]> ret = new ArrayList<>(); List<List<Integer>> ret = new ArrayList<>();
if (matrix == null || matrix.length == 0) { if (matrix == null || matrix.length == 0) {
return ret; return ret;
} }
@ -532,7 +531,7 @@ public List<int[]> pacificAtlantic(int[][] matrix) {
for (int i = 0; i < m; i++) { for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) { for (int j = 0; j < n; j++) {
if (canReachP[i][j] && canReachA[i][j]) { if (canReachP[i][j] && canReachA[i][j]) {
ret.add(new int[]{i, j}); ret.add(Arrays.asList(i, j));
} }
} }
} }