Best Poker Hand LeetCode solution in C++

1
class Solution {
2
 public:
3
  string bestHand(vector<int> &ranks, vector<char> &suits) {
4
    map<int, int> m1;
5
    int mn = INT_MIN;
6
    int all_same = count(begin(suits), end(suits), suits[0]);
7
    int n = ranks.size();
8
    for (int i = 0; i < n; i++) {
9
      m1[ranks[i]]++;
10
      mn = max(mn, m1[ranks[i]]);
11
    }
12
    if (all_same == n) return "Flush";
13
    if (mn >= 3) return "Three of a Kind";
14
    if (mn == 2) return "Pair";
15
    return "High Card";
16
  }
17
};