[Array] swea-1954

Author: Seogeurim

README.md

@@ -99,6 +99,7 @@
 | 06  |     | [Codility-Lesson4 MaxCounters](./src/Array/MaxCounters)                     |      |
 | 07  |     | [SWEA-1208 Flatten](./src/Array/swea1208)                                   |      |
 | 08  |     | [SWEA-1210 Ladder1](./src/Array/swea1210)                                   |      |
+| 09  |     | [SWEA-1954 달팽이 숫자](./src/Array/swea1954)                                  |      |
 
 ### Stack
 

src/Array/swea1954/README.md

@@ -0,0 +1,5 @@
+## [SW Expert Academy - 1954] 달팽이 숫자
+
+![image](https://user-images.githubusercontent.com/22045163/106583980-02648880-6589-11eb-9638-e0250d586d3e.png)
+![image](https://user-images.githubusercontent.com/22045163/106584090-22944780-6589-11eb-9de2-97f484931762.png)
+![image](https://user-images.githubusercontent.com/22045163/106584206-45bef700-6589-11eb-8001-a2d9bda538c8.png)

src/Array/swea1954/Solution.java

@@ -0,0 +1,44 @@
+package Array.swea1954;
+
+import java.io.*;
+
+public class Solution {
+
+    static int T, N;
+    static int[][] arr;
+
+    static int[] di = {0, 1, 0, -1};
+    static int[] dj = {1, 0, -1, 0};
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/Array/swea1954/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        T = Integer.parseInt(br.readLine());
+        for (int t = 1; t <= T; t++) {
+            N = Integer.parseInt(br.readLine());
+            arr = new int[N][N];
+
+            int num = 1;
+            int i = 0, j = 0, dir = 0;
+            while (num <= N*N) {
+                arr[i][j] = num++;
+                if (!canGo(i + di[dir % 4], j + dj[dir % 4])) dir ++;
+                i += di[dir % 4];
+                j += dj[dir % 4];
+            }
+
+            System.out.println("#" + t);
+            for (i = 0; i < N; i++) {
+                for (j = 0; j < N; j++) {
+                    System.out.print(arr[i][j] + " ");
+                }
+                System.out.println();
+            }
+        }
+    }
+
+    static boolean canGo(int i, int j) {
+        return 0 <= i && i < N && 0 <= j && j < N && arr[i][j] == 0;
+    }
+}

src/Array/swea1954/input.txt

@@ -0,0 +1,11 @@
+10
+1
+2
+3
+4
+5
+6
+7
+8
+9
+10