Merge pull request #64 from AlgoLeadMe/17-InSange

17-InSange

InSange/README.md

@@ -18,4 +18,5 @@
 | 14차시 | 2024.05.27 |  투 포인터  | [포도주 시음](https://www.acmicpc.net/problem/31589)  | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/56)]
 | 15차시 | 2024.05.27 |  정렬  | [통나무 건너뛰기](https://www.acmicpc.net/problem/11497)  | [#15](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/57)]
 | 16차시 | 2024.06.28 |  그래프  | [Maximum_Total_Importance_ofRoads](https://leetcode.com/problems/maximum-total-importance-of-roads/)  | [#16](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/63)]
+| 17차시 | 2024.06.28 |  문자열  | [Zigzag Conversion](https://leetcode.com/problems/zigzag-conversion/)  | [#17](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/64)]
 ---

InSange/문자열/6_Zigzag Conversion.cpp

@@ -0,0 +1,35 @@
+#include <vector>
+#include <iostream>
+
+using namespace std;
+
+class Solution {
+public:
+    string convert(string s, int numRows) {
+        if (numRows <= 1 || s.size() <= numRows) return s;
+
+        vector<string>v(numRows, "");
+
+        int i, j, dir;
+        j = 0;
+        dir = -1;
+
+        for (i = 0; i < s.size(); i++)
+        {
+            if (j == numRows - 1 || j == 0) dir *= -1;
+            v[j] += s[i];
+            if (dir == 1) j++;
+            else j--;
+        }
+
+        string answer;
+        answer = "";
+
+        for (auto c : v)
+        {
+            answer += c;
+        }
+
+        return answer;
+    }
+};