1258 SW Expert 행렬찾기

 
 
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
 
public class Solution {
    static int dx[] = {0,0,1,-1};
    static int dy[] = {1,-1,0,0};
    static int n;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int testcase = sc.nextInt();
        for(int t = 1; t <= testcase; t++) {
            n= sc.nextInt();
            int arr[][] = new int [n][n];
            boolean boo[][] = new boolean [n][n];
            for(int i = 0; i < n; i++) {
                for(int j = 0; j < n; j++)
                    arr[i][j] = sc.nextInt();
            }//endofarr
            ArrayList<matrix> arra = new ArrayList<>();
            for(int i = 0; i < n; i++) {
                for(int j = 0; j < n; j++) {
                    if(arr[i][j] != 0 && boo[i][j] == false) {
                        int nu[] = {1,1};
                        findout(arr,boo,i,j,nu,i);
                        arra.add(new matrix(nu[0],nu[1]));
                    }
                }
            }//endofarr
            
            Collections.sort(arra);
            System.out.print("#" + t + " " + arra.size());
            for(matrix i : arra) {
            
                System.out.print(" " + i.start + " " +i.end);
            }
            System.out.println();
        }//end of testcase
 
      
    }//end of main
    
    public static int[] findout(int ar[][], boolean[][] bo, int row, int col, int num[],int row2) {
        bo[row][col] = true;
        for(int i = 0; i < 4; i++) {
            int ro = row + dx[i];
            int co = col + dy[i];
            if(ro >= 0 && co >= 0 && ro < n && co < n) {
                if(bo[ro][co] == true)
                    continue;
                if(ar[ro][co] == 0)
                    continue;
                if(ro == row+1) {
                    num[0]++;
                return findout(ar,bo,ro,co,num,row2);
                }
                if(co == col+1 && ro == row2) {
                    num[1]++;
                return findout(ar, bo, ro, co, num,row2);
                }
                return findout(ar, bo, ro, co, num,row2);
            }
        }
        return num;
    }
 
      public static class matrix implements Comparable<matrix>{
            int start,end;
            public matrix(int start,int end) {
                this.start = start;
                this.end = end;
            }
            public int compareTo(matrix d) {
                if(this.start*this.end > d.start*d.end) {
                    return 1;
                }
                else if(this.start*this.end < d.start*d.end) {
                    return -1;
                }
                else {
                    if(this.start < d.start) {
                        return -1;
                    }
                    return 0;
                }
            }
        }
}//end of class
 

재귀를 활용하여 탐색, 탐색까지는 매우 쉽게 구현했으나 

정렬 및 출력이 매우 어려웠다.