Minimum Number of Frogs Croaking LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minNumberOfFrogs(string croakOfFrogs) {
4
    unordered_map<char, int> mp;
5
    int size = croakOfFrogs.size();
6

7
    for (int i = 0; i < size; i++) {
8
      mp[croakOfFrogs[i]]++;
9
      if (mp['c'] < mp['r'] || mp['r'] < mp['o'] || mp['o'] < mp['a'] || mp['a'] < mp['k'])
10
        return -1;
11
    }
12

13
    int count = mp[croakOfFrogs[0]];
14
    for (auto i : croakOfFrogs) {
15
      if (count != mp[i]) return -1;
16
    }
17

18
    int ans = 0;
19
    int i = 0;
20
    int temp = 0;
21

22
    for (i = 0; i < size; i++) {
23
      if (croakOfFrogs[i] == 'c') {
24
        temp++;
25
      } else if (croakOfFrogs[i] == 'k') {
26
        temp--;
27
      }
28
      if (temp > ans) ans = temp;
29
    }
30
    return ans;
31
  }
32
};