[Array] swea-1210

Author: Seogeurim

README.md

@@ -98,6 +98,7 @@
 | 05  |     | [Codility-Lesson4 MissingInteger](./src/Array/MissingInteger)               |      |
 | 06  |     | [Codility-Lesson4 MaxCounters](./src/Array/MaxCounters)                     |      |
 | 07  |     | [SWEA-1208 Flatten](./src/Array/swea1208)                                   |      |
+| 08  |     | [SWEA-1210 Ladder1](./src/Array/swea1210)                                   |      |
 
 ### Stack
 

src/Array/swea1210/README.md

@@ -0,0 +1,7 @@
+## [SW Expert Academy - 1210] Ladder1
+
+![image](https://user-images.githubusercontent.com/22045163/106583093-0a6ff880-6588-11eb-895a-7be1ca14d594.png)
+![image](https://user-images.githubusercontent.com/22045163/106583132-16f45100-6588-11eb-8748-657fca76c9a7.png)
+![image](https://user-images.githubusercontent.com/22045163/106583202-2ecbd500-6588-11eb-97ec-dac365f31d43.png)
+![image](https://user-images.githubusercontent.com/22045163/106583230-38553d00-6588-11eb-945c-2405bef60d3b.png)
+![image](https://user-images.githubusercontent.com/22045163/106583404-689cdb80-6588-11eb-8e10-52acbd864987.png)

src/Array/swea1210/Solution.java

@@ -0,0 +1,42 @@
+package Array.swea1210;
+
+import java.io.*;
+import java.util.*;
+
+public class Solution {
+
+    final static int T = 10, N = 100;
+    static int[][] ladder;
+    static int[] current;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/Array/swea1210/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        for (int t = 1; t <= T; t++) {
+            br.readLine();
+            ladder = new int[N][N];
+
+            for (int i = 0; i < N; i++) {
+                StringTokenizer st = new StringTokenizer(br.readLine());
+                for (int j = 0; j < N; j++) {
+                    ladder[i][j] = Integer.parseInt(st.nextToken());
+                    if (ladder[i][j] == 2) current = new int[]{i, j};
+                }
+            }
+
+            while (current[0] >= 0) {
+                boolean rotated = false;
+                for (int d = -1; d <= 1 && !rotated; d += 2) {
+                    while (0 <= current[1]+d && current[1]+d < N && ladder[current[0]][current[1]+d] == 1) {
+                        rotated = true;
+                        current[1] += d;
+                    }
+                }
+                current[0] --;
+            }
+
+            System.out.println("#" + t  + " " + current[1]);
+        }
+    }
+}