Merge pull request #35 from AlgoLeadMe/8-g0rnn

8-g0rnn

.gitignore

@@ -1 +1,2 @@
 .DS_Store
+/.vscode

g0rnn/README.md

@@ -9,5 +9,6 @@
 | 5차시 | 2024.11.01 |  BFS/DFS   |                [연구소](https://www.acmicpc.net/problem/14502)                | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/17 |
 | 6차시 | 2024.11.06 |    구현    |                [통계학](https://www.acmicpc.net/problem/2108)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/23 |
 | 7차시 | 2024.11.25 |    구현    |            [팰린드롬 만들기](https://www.acmicpc.net/problem/1213)            | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/31 |
+| 8차시 | 2024.11.29 |    문자열    |            [잠수함식별](https://www.acmicpc.net/problem/2671)            | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/35 |
 
 ---

g0rnn/문자열/8-g0rnn-2.cpp

@@ -0,0 +1,36 @@
+#include <algorithm>
+#include <iostream>
+#include <vector>
+using namespace std;
+
+bool compareLength(string a, string b) { return a.length() < b.length(); }
+
+bool isStartWith(const string& str, const string& prefix) {
+    return str.compare(0, prefix.length(), prefix) == 0;
+}
+
+int main() {
+    int n;
+    cin >> n;
+    vector<string> prefix(n);
+    for (int i = 0; i < n; i++) {
+        cin >> prefix[i];
+    }
+
+    // Sort by string length
+    sort(prefix.begin(), prefix.end(), compareLength);
+
+    int answer = n;
+    for (int i = 0; i < n - 1; i++) {
+        for (int j = i + 1; j < n; j++) {
+            if (isStartWith(prefix[j], prefix[i])) {
+                // 접두사가 있으면 i번째 단어를 없앰
+                // 정렬했으니 자신보다 문자열이 긴것만 보면됨
+                answer--;
+                break;
+            }
+        }
+    }
+    cout << answer;
+    return 0;
+}

g0rnn/문자열/8-g0rnn.cpp

@@ -0,0 +1,14 @@
+#include <iostream>
+#include <regex>
+using namespace std;
+
+int main() {
+    string sound;
+    cin >> sound;
+
+    if (regex_match(sound, regex("(100+1+|01)+")))
+        cout << "SUBMARINE\n";
+    else
+        cout << "NOISE\n";
+    return 0;
+}