Skip to content
Open
Changes from all commits
Commits
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
43 changes: 43 additions & 0 deletions problems/kamacoder/0106.岛屿的周长.md
Original file line number Diff line number Diff line change
Expand Up @@ -160,6 +160,7 @@ int main() {
## 其他语言版本

### Java
解法一
```Java
import java.util.*;

Expand Down Expand Up @@ -215,6 +216,48 @@ public class Main {
}
}
```
解法二
```java
import java.util.Scanner;

public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();

int[][] grid = new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
grid[i][j] = sc.nextInt();
}
}

int sum = 0; // 陆地数量
int cover = 0; // 相邻陆地对数(仅统计上边和左边)

for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (grid[i][j] == 1) {
sum++; // 统计陆地总数
// 检查上方是否有陆地
if (i - 1 >= 0 && grid[i - 1][j] == 1) {
cover++;
}
// 检查左方是否有陆地
if (j - 1 >= 0 && grid[i][j - 1] == 1) {
cover++;
}
// 不检查下方和右方,避免重复计算
}
}
}

System.out.println(sum * 4 - cover * 2);
sc.close();
}
}
```

### Python

Expand Down