leecode.1419.数青蛙

题目

数青蛙

代码

class Solution {
public:
    int minNumberOfFrogs(string croakOfFrogs) {
        vector<vector<int>> pos(5);
        map<char, int> mapTable = {{'c', 0},{'r', 1}, {'o', 2},{'a', 3},{'k', 4}};
        for(int i = 0;i < croakOfFrogs.size();i++)
            pos[mapTable[croakOfFrogs[i]]].push_back(i);
        bool flag = true;
        for(int i = 1;i < 5;i++)
            flag &= (pos[i].size() == pos[i - 1].size());
        if(!flag) return -1;
        
        int n = pos[0].size(), ans = 1;

        for(int j = 0;j < n;j++){
            flag = true;
            for(int i = 1;i < 5;i++)
                flag &= (pos[i - 1][j] < pos[i][j]);
            if(!flag) return -1;
        }
        queue<int> q;
        q.push(0);
        vector<bool> vis(n, false);
        vis[0] = true;
        int tot = 1;
        while(!q.empty()){
            int cur = q.front();
            while(tot < n && pos[4][cur] > pos[0][tot]){
                if(!vis[tot]){
                    vis[tot] = true;
                    q.push(tot);
                } 
                tot++; 
            }
            ans = (ans > q.size()) ? ans : q.size();
            q.pop();
        }
        return ans;
    }
};