Algorithm/java-project/src/main/java/swe1216.java at master · csyang123/Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
import java.util.Scanner;
import java.util.*;

public class swe1216 {
    static Scanner sc  = new Scanner(System.in);
    static int answer = 0;
    static StringBuffer SB = new StringBuffer();

    public static void main(String[] args) {
        //split을 이용한 문자열이 포함된 숫자세기
        for(int T=1; T<=10; T++) {
            int number = sc.nextInt();
            int N = 100;
            sc.nextLine();

            //초기화
            char[][] Arr = new char[N][N];
            for(int i=0; i<N; i++)
            {
                String strRow = sc.nextLine();
                for(int j=0; j<N; j++)
                {
                    Arr[i][j] = strRow.charAt(j);
                }
            }

            for(int i=1;i<N; i++)
            {
                rowFirst(Arr, i ,N);
                columFirst(Arr, i, N);
            }

            System.out.println("#" + T + " " + answer );
            answer = 0;
        }
    }

    public static void rowFirst(char[][] Arr, int number, int N)
    {
        String buffer = "";
        String buffer_Reverse ="";
        for(int i =0; i<N; i++)
        {
            for(int j=0; (j+number)<=N; j++)
            {
                for(int k=0; k<number; k++)
                {
                    buffer += Arr[i][j+k];
                }

                SB = new StringBuffer(buffer);
                buffer_Reverse = SB.reverse().toString();

                if(buffer.equals(buffer_Reverse))
                    answer = Math.max(answer, buffer.length());

                //다음 작업을 위한 초기화
                buffer ="";
                buffer_Reverse ="";

            }
        }
    }


    public static void columFirst(char[][] Arr, int number, int N)
    {
        String buffer = "";
        String buffer_Reverse ="";
        for(int i =0; i<N; i++)
        {
            for(int j=0; (j+number)<=N; j++)
            {
                for(int k=0; k<number; k++)
                {
                    buffer += Arr[j+k][i];
                }

                SB = new StringBuffer(buffer);
                buffer_Reverse = SB.reverse().toString();

                if(buffer.equals(buffer_Reverse))
                    answer = Math.max(answer, buffer.length());

                //다음 작업을 위한 초기화
                buffer ="";
                buffer_Reverse ="";


            }
        }

    }

}