2347 solved.

liuyubobobo · liuyubobobo · commit 056f8f6d8925 · 2022-07-23T19:27:27.000-07:00
diff --git a/2001-2500/2347-Best-Poker-Hand/cpp-2347/CMakeLists.txt b/2001-2500/2347-Best-Poker-Hand/cpp-2347/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(cpp_2347)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cpp_2347 main.cpp)
diff --git a/2001-2500/2347-Best-Poker-Hand/cpp-2347/main.cpp b/2001-2500/2347-Best-Poker-Hand/cpp-2347/main.cpp
@@ -0,0 +1,50 @@
+/// Source : https://leetcode.com/problems/best-poker-hand/
+/// Author : liuyubobobo
+/// Time   : 2022-07-23
+
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+
+/// Simulation
+/// Time Complexity: O(nlogn)
+/// Space Complexity: O(1)
+class Solution {
+public:
+    string bestHand(vector<int>& ranks, vector<char>& suits) {
+
+        if(is_flush(suits)) return "Flush";
+
+        sort(ranks.begin(), ranks.end());
+        int max_same = get_max_same(ranks);
+        if(max_same >= 3) return "Three of a Kind";
+        else if(max_same == 2) return "Pair";
+        return "High Card";
+    }
+
+private:
+    int get_max_same(const vector<int>& data){
+
+        int n = data.size(), res = 0;
+        for(int start = 0, i = 1; i <= n; i ++)
+            if(i == n || data[i] != data[start]){
+                res = max(res, i - start);
+                start = i;
+            }
+        return res;
+    }
+
+    bool is_flush(const vector<char>& suits){
+        for(int i = 1; i < suits.size(); i ++)
+            if(suits[i] != suits[0]) return false;
+        return true;
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -2196,6 +2196,8 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 2343 | [Query Kth Smallest Trimmed Number](https://leetcode.com/problems/query-kth-smallest-trimmed-number/) | [无] | [C++](2001-2500/2343-Query-Kth-Smallest-Trimmed-Number/cpp-2343/) | | |
 | 2344 | [Minimum Deletions to Make Array Divisible](https://leetcode.com/problems/minimum-deletions-to-make-array-divisible/) | [无] | [C++](2001-2500/2344-Minimum-Deletions-to-Make-Array-Divisible/cpp-2344/) | | |
 | 2345 | [Finding the Number of Visible Mountains](https://leetcode.com/problems/finding-the-number-of-visible-mountains/) | [无] | [C++](2001-2500/2345-Finding-the-Number-of-Visible-Mountains/cpp-2345/) | | |
+| 2346 | Database Problem: [Link](https://github.com/liuyubobobo/Play-Leetcode-Database/) | - | - | - | - |
+| 2347 | [Best Poker Hand](https://leetcode.com/problems/best-poker-hand/) | [无] | [C++](2001-2500/2347-Best-Poker-Hand/cpp-2347/) | | |
 | | | | | | |
 
 ## 力扣中文站比赛
