201512-2 消除类游戏

原始数据用int二维数组存储，要置0的数据使用二维布尔数组存储

1、遍历每一行找到每行重复出现超过三次的位置，并将布尔数组中相应位置的值置为true（注意不要直接将原始数组相应位置的值置为0，这样会导致遍历列时元素的值不对）

2、列操作同上

奉上java满分代码

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String[] firstLine = scanner.nextLine().split(" ");
        int r = Integer.parseInt(firstLine[0]);
        int c = Integer.parseInt(firstLine[1]);
        int[][] map = new int[r][c];
        for (int i = 0; i < r; i++) {
            String[] line = scanner.nextLine().split(" ");
            for (int j = 0; j < c; j++) {
                map[i][j] = Integer.parseInt(line[j]);
            }
        }
        scanner.close();

        boolean[][] remove = new boolean[r][c];
        for (int i = 0; i < r; i++) {
            int j = 0;
            int count = 0;
            int last = 0;
            while (j < c) {
                int curr = map[i][j];
                if (curr != last) {
                    count = 1;
                    last = curr;
                } else {
                    count++;
                    if (count >= 3) {
                        for (int k = 0; k < count; k++) {
                            remove[i][j - k] = true;
                        }
                    }
                }
                j++;
            }
        }

        for (int j = 0; j < c; j++) {
            int i = 0;
            int count = 0;
            int last = 0;
            while (i < r) {
                int curr = map[i][j];
                if (curr != last) {
                    count = 1;
                    last = curr;
                } else {
                    count++;
                    if (count >= 3) {
                        for (int k = 0; k < count; k++) {
                            remove[i - k][j] = true;
                        }
                    }
                }
                i++;
            }
        }

        for(int i = 0; i < r; i++){
            for(int j = 0; j < c; j++){
                int number = remove[i][j] ? 0 : map[i][j];
                System.out.print(number + " ");
            }
            System.out.println();
        }
    }

}