From 5dad0b416c39ba294cbc7546c9cb7823359e2f2f Mon Sep 17 00:00:00 2001
From: westwood0722 <63458011+westwood0722@users.noreply.github.com>
Date: Thu, 28 Jan 2021 17:02:27 +0900
Subject: [PATCH] Create arr2D.cc

---
 SampleCodes/Array/arr2D.cc | 108 +++++++++++++++++++++++++++++++++++++
 1 file changed, 108 insertions(+)
 create mode 100644 SampleCodes/Array/arr2D.cc

diff --git a/SampleCodes/Array/arr2D.cc b/SampleCodes/Array/arr2D.cc
new file mode 100644
index 00000000..9e8b7874
--- /dev/null
+++ b/SampleCodes/Array/arr2D.cc
@@ -0,0 +1,108 @@
+### 1. 2차원 배열 +90도 회전
+
+```cpp
+#include <iostream>
+
+using namespace std;
+
+void rotate() {
+    char arr1[3][3];
+    char arr2[3][3];
+    int i, j;
+    char alphabet = 'A';
+
+    for (i = 0; i < 3; i++) {
+        for (j = 0; j < 3; j++) {
+            arr1[i][j] = alphabet;
+            alphabet++;
+        }
+    }
+
+    for (i = 0; i < 3; i++) {
+        for (j = 0; j < 3; j++) {
+            cout << arr1[i][j];
+        }
+        cout << endl;
+    }
+
+    cout << "==================" << endl;
+
+    for (i = 0; i < 3; i++) {
+        for (j = 0; j < 3; j++) {
+            arr2[j][2 - i] = arr1[i][j];
+        }
+    }
+
+    for (i = 0; i < 3; i++) {
+        for (j = 0; j < 3; j++) {
+            cout << arr2[i][j];
+        }
+        cout << endl;
+    }
+
+}
+
+int main() {
+    rotate();
+
+    return 0;
+}
+```
+
+
+### 2. 2차원 배열 상하 반전
+```cpp
+    cout << "==================" << endl;
+
+    for (i = 0; i < 3; i++) {
+        for (j = 0; j < 3; j++) {
+            arr2[2 - i][j] = arr1[i][j]; //수정 된 부분
+        }
+    }
+
+    for (i = 0; i < 3; i++) {
+        for (j = 0; j < 3; j++) {
+            cout << arr2[i][j];
+        }
+        cout << endl;
+    }
+}
+
+```
+
+### 3. 2차원 배열 좌우 반전
+```cpp
+    for (i = 0; i < 3; i++) {
+        for (j = 0; j < 3; j++) {
+            arr2[i][2 - j] = arr1[i][j]; //수정 된 부분
+        }
+    }
+
+    for (i = 0; i < 3; i++) {
+        for (j = 0; j < 3; j++) {
+            cout << arr2[i][j];
+        }
+        cout << endl;
+    }
+}
+
+```
+
+### 4. 2차원 배열 대각선 반전
+```cpp
+
+    for (i = 0; i < 3; i++) {
+        for (j = 0; j < 3; j++) {
+            arr2[2 - i][2 - j] = arr1[i][j]; //수정 된 부분
+        }
+    }
+
+    for (i = 0; i < 3; i++) {
+        for (j = 0; j < 3; j++) {
+            cout << arr2[i][j];
+        }
+        cout << endl;
+    }
+}
+
+```