宝岛探险
題目描述
一個小島由一個主島和一些復附屬島嶼組成，該島使用一個二維矩陣表示，其中數(shù)字表示海拔，0表示海洋，1~9表示陸地。探險家乘坐飛機降落在（6,8）處，現(xiàn)在需要統(tǒng)計探險家降落的小島的面積大小，我們將探險家降落點上下左右相連接的陸地視作同一個島嶼
測試樣例
10 10 6 8 1 2 1 0 0 0 0 0 2 3 3 0 2 0 1 2 1 0 1 2 4 0 1 0 1 2 3 2 0 1 3 2 0 0 0 1 2 4 0 0 0 0 0 0 0 0 1 5 3 0 0 1 2 1 0 1 5 4 3 0 0 1 2 3 1 3 6 2 1 0 0 0 3 4 8 9 7 5 0 0 0 0 0 3 7 8 6 0 1 2 0 0 0 0 0 0 0 0 1 0測試結(jié)果
38示范代碼
import java.util.Scanner;/* 測試數(shù)據(jù) 10 10 6 8 1 2 1 0 0 0 0 0 2 3 3 0 2 0 1 2 1 0 1 2 4 0 1 0 1 2 3 2 0 1 3 2 0 0 0 1 2 4 0 0 0 0 0 0 0 0 1 5 3 0 0 1 2 1 0 1 5 4 3 0 0 1 2 3 1 3 6 2 1 0 0 0 3 4 8 9 7 5 0 0 0 0 0 3 7 8 6 0 1 2 0 0 0 0 0 0 0 0 1 0 * //*** Created by handsome programmer with IntelliJ IDEA.* User: chen* Date: 18-12-6* Time: 上午3:03* Description: 寶島探險** @author chen*/ public class Search {public static void main(String[] args) {// 定義四個方向int[][] next = {// 向右走{0, 1},// 向左走{0, -1},// 向上走{1, 0},// 向下走{-1, 0}};Scanner scanner = new Scanner(System.in);// 地圖大小，n行m列int n = scanner.nextInt();int m = scanner.nextInt();// 起始位置int startX = scanner.nextInt();int startY = scanner.nextInt();// 標記數(shù)組int[][] mark = new int[n + 1][m + 1];// 遍歷隊列Node[] queue = new Node[n * m + 1];// 加載地圖int[][] map = new int[n + 1][m + 1];for (int i = 1; i <= n; i++) {for (int j = 1; j <= m; j++) {map[i][j] = scanner.nextInt();}}// 初始化隊列兩個游標int head = 1;int tail = 1;// 將降落的起始坐標插入隊列Node node = new Node(startX, startY);queue[tail++] = node;// 將降落點標記為已遍歷mark[startX][startY] = 1;int sum = 1;while (head < tail) {// 枚舉當前點的四個方向for (int i = 0; i < 4; i++) {// 下一個的坐標int x = queue[head].getX() + next[i][0];int y = queue[head].getY() + next[i][1];// 判斷是否越界if (x < 1 || x > n || y < 1 || y > m) {continue;}// 判斷是否遍歷過該點并且改點是否是陸地if (map[x][y] != 0 && mark[x][y] == 0) {sum++;// 入隊該節(jié)點并標記為已遍歷queue[tail++] = new Node(x, y);mark[x][y] = 1;}}head++;}// 輸出島的大小System.out.println("島的大小為：" + sum);} }class Node {/*** 橫坐標*/private int x;/*** 縱坐標*/private int y;public Node(int x, int y) {this.x = x;this.y = y;}public Node() {}public int getX() {return x;}public void setX(int x) {this.x = x;}public int getY() {return y;}public void setY(int y) {this.y = y;} }總結(jié)
