解：搜索，把点了的标记下来，然后移除。

import java.util.ArrayList;
import java.util.Scanner;/*** * 作者：张宇翔 创建日期：2017年7月27日 上午11:35:04 描述：*/
public class Main {private static final int Max = (int) (10);private static int FLAG = -1;private static String s;private static int[] a;private static int len;private static final int RED = 0, GREEN = 1, BLUE = 2, YELLOW = 3, PURPLE = 4;private static ArrayList<ArrayList<Integer>> list;private static int p[][] = { { RED, RED, BLUE, BLUE, GREEN, YELLOW, BLUE, YELLOW, RED, PURPLE },{ GREEN, GREEN, GREEN, BLUE, RED, PURPLE, RED, YELLOW, YELLOW, BLUE },{ BLUE, RED, RED, YELLOW, YELLOW, PURPLE, BLUE, GREEN, GREEN, BLUE },{ YELLOW, RED, BLUE, YELLOW, BLUE, RED, PURPLE, GREEN, GREEN, RED },{ YELLOW, RED, BLUE, BLUE, PURPLE, GREEN, PURPLE, RED, YELLOW, BLUE },{ PURPLE, YELLOW, RED, RED, YELLOW, RED, PURPLE, YELLOW, RED, RED },{ YELLOW, YELLOW, GREEN, PURPLE, GREEN, RED, BLUE, YELLOW, BLUE, GREEN },{ RED, YELLOW, BLUE, BLUE, YELLOW, GREEN, PURPLE, RED, BLUE, GREEN },{ GREEN, GREEN, YELLOW, YELLOW, RED, RED, PURPLE, BLUE, BLUE, GREEN },{ PURPLE, BLUE, RED, RED, PURPLE, YELLOW, BLUE, RED, RED, GREEN } };private static int[][] dir = new int[][] { { 1, 0 }, { -1, 0 }, { 0, 1 }, { 0, -1 } };public static void main(String[] args) {InitData();}private static void InitData() {Scanner cin = new Scanner(System.in);s = new String();while (cin.hasNext()) {s = cin.nextLine();String[] ans = s.split(" ");len = ans.length;a = new int[len];// 每行输入的数for (int i = 0; i < len; i++) {a[i] = Integer.parseInt(ans[i]);}list=new ArrayList<>();for(int i=0;i<Max;i++){list.add(new ArrayList<Integer>(10));}for(int i=0;i<Max;i++){for(int j=0;j<Max;j++){list.get(i).add(p[9-j][i]);}}GetAns();}};private static void GetAns() {for (int i = 0; i < len; i++) {int x=(a[i]-1)%10;int y=9-(a[i]-1)/10;if(x>=list.size()||y>=list.get(x).size()){continue;}boolean ok=false;for(int j=0;j<4;j++){int newx=x+dir[j][0];int newy=y+dir[j][1];if(Check(newx, newy)&&list.get(newx).get(newy)==list.get(x).get(y)){ok=true;break;}}//如果ok=true,说明有星星可以消除if(!ok){continue;}dfs( x, y, list.get(x).get(y));for(int j=0;j<list.size();j++){list.get(j).removeIf(s->s==FLAG);}list.removeIf(s->s.isEmpty()==true);}int k[]=new int[5];for(int i=0;i<list.size();i++){for(int j=0;j<list.get(i).size();j++){k[list.get(i).get(j)]++;}}for(int i=0;i<5;i++){if(i==0){System.out.print(k[i]);}else{System.out.print(" "+k[i]);}}System.out.println();};// 检查是否合法private static boolean Check(int x, int y) {if (x >= 0 && x < list.size() && y >= 0 && y < list.get(x).size())return true;return false;}//搜索，标记private static void dfs(int x,int y,int color) {list.get(x).set(y, FLAG);for(int i=0;i<4;i++){int newx=x+dir[i][0];int newy=y+dir[i][1];if(Check(newx, newy)&&list.get(newx).get(newy)==color){dfs(newx, newy, color);}}}
}