[swexpert] 1210. Ladder1

[swexpert] 1210. Ladder1

문제 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14ABYKADACFAYh&categoryId=AV14ABYKADACFAYh&categoryType=CODE

import java.util.Scanner;
 
public class Solution {
    
    static int[][] data = new int[100][102];
 
    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        
        for (int t = 1; t <= 10; t++) {
            int ts = sc.nextInt();
            
            for (int x = 0; x < data.length; x++) {
                for (int y = 1; y < data[x].length - 1; y++) {
                    data[x][y] = sc.nextInt();
                }
            }
            
            for (int x = 0; x < data.length; x++) {
                for (int y = 0; y < data[x].length; y++) {
                    if(data[x][y] == 2) {
                        
                        int start = 0;
                        int flag = 0;
                        int i = x, j = y;
                        
                        while(true) {
                            switch (flag) {
                            case 0:    // 상
                                if(data[i-1][j] == 1) {
                                    i--;
                                    
                                    if(data[i][j-1] == 1) {
                                        j--;
                                        flag = 1;
                                        break;
                                    }
                                    else if(data[i][j+1] == 1) {
                                        j++;
                                        flag = 2;
                                        break;
                                    }
                                }
                                
                                break;
                            case 1: // 좌
                                if(data[i][j-1] == 1) {
                                    j--;
                                }
                                else {
                                    flag = 0;
                                }
                                break;
                            case 2: // 우
                                if(data[i][j+1] == 1) {
                                    j++;
                                }
                                else {
                                    flag = 0;
                                }
                                break;
                            }
                            if ( i == 0 ) break; // 도착
                        }
                        System.out.println();
                        System.out.print("#" + t + " " + (j-1));
                    }
                }
            }
            
            
            
        }
        
    }
 
}