2350 solved.

liuyubobobo · liuyubobobo · commit bb296a297da2 · 2022-07-23T20:58:39.000-07:00
diff --git a/2001-2500/2350-Shortest-Impossible-Sequence-of-Rolls/cpp-2350/CMakeLists.txt b/2001-2500/2350-Shortest-Impossible-Sequence-of-Rolls/cpp-2350/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(cpp_2350)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cpp_2350 main.cpp)
diff --git a/2001-2500/2350-Shortest-Impossible-Sequence-of-Rolls/cpp-2350/main.cpp b/2001-2500/2350-Shortest-Impossible-Sequence-of-Rolls/cpp-2350/main.cpp
@@ -0,0 +1,39 @@
+/// Source : https://leetcode.com/problems/shortest-impossible-sequence-of-rolls/
+/// Author : liuyubobobo
+/// Time   : 2022-07-23
+
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+
+/// Greedy
+/// Time Complexity: O(n + k)
+/// Space Compelxity: O(k)
+class Solution {
+public:
+    int shortestSequence(vector<int>& rolls, int k) {
+
+        vector<bool> used(k + 1, false);
+        int cnt = 0, res = 0;
+        for(int e: rolls){
+            if(!used[e]){
+                used[e] = true;
+                cnt ++;
+                if(cnt == k){
+                    res ++;
+                    used.assign(k + 1, false);
+                    cnt = 0;
+                }
+            }
+        }
+        return res;
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -2200,6 +2200,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 2347 | [Best Poker Hand](https://leetcode.com/problems/best-poker-hand/) | [无] | [C++](2001-2500/2347-Best-Poker-Hand/cpp-2347/) | | |
 | 2348 | [Number of Zero-Filled Subarrays](https://leetcode.com/problems/number-of-zero-filled-subarrays/) | [无] | [C++](2001-2500/2348-Number-of-Zero-Filled-Subarrays/cpp-2348/) | | |
 | 2349 | [Design a Number Container System](https://leetcode.com/problems/design-a-number-container-system/) | [无] | [C++](2001-2500/2349-Design-a-Number-Container-System/cpp-2349/) | | |
+| 2350 | [Shortest Impossible Sequence of Rolls](https://leetcode.com/problems/shortest-impossible-sequence-of-rolls/) | [无] | [C++](2001-2500/2350-Shortest-Impossible-Sequence-of-Rolls/cpp-2350/) | | |
 | | | | | | |
 
 ## 力扣中文站比赛
