66-9kyo-hwang

9-kyo-hwang/README.md

@@ -66,3 +66,4 @@
 | 63차시 | 2024.9.3   | Binary Search              | [구간 나누기2](https://www.acmicpc.net/problem/13397)   | [#218](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/218) |
 | 64차시 | 2024.9.8   | Binary Search              | [징검다리](https://school.programmers.co.kr/learn/courses/30/lessons/43236)   | [#221](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/221) |
 | 65차시 | 2024.9.11  | Greedy                     | [디펜스 게임](https://school.programmers.co.kr/learn/courses/30/lessons/142085)   | [#224](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/224) |
+| 66차시 | 2024.9.14  | Sliding Window             | [할인 행사](https://school.programmers.co.kr/learn/courses/30/lessons/131127)   | [#225](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/225) |

9-kyo-hwang/Sliding Window/할인 행사.cpp

@@ -0,0 +1,35 @@
+#include <string>
+#include <vector>
+#include <unordered_map>
+
+using namespace std;
+
+int solution(vector<string> InWants, vector<int> InNumbers, vector<string> InDiscounts) 
+{
+    unordered_map<string, int> NumberbyWants;
+    for(int i = 0; i < 9; ++i)
+    {
+        NumberbyWants[InDiscounts[i]]++;
+    }
+
+    int Answer = 0;
+    for(int i = 9; i < InDiscounts.size(); ++i)
+    {
+        NumberbyWants[InDiscounts[i]]++;
+        bool Flag = true;
+
+        for(int j = 0; j < InWants.size(); ++j)
+        {
+            if(NumberbyWants[InWants[j]] != InNumbers[j])
+            {
+                Flag = false;
+                break;
+            }
+        }
+
+        Answer += Flag;
+        NumberbyWants[InDiscounts[i - 9]]--;
+    }
+
+    return Answer;
+}