LeetCode刷题笔记 5390. 数青蛙【字符串】

最新推荐文章于 2022-05-16 16:56:03 发布

三重极简

最新推荐文章于 2022-05-16 16:56:03 发布

阅读量245

点赞数

原文链接：https://leetcode-cn.com/problems/minimum-number-of-frogs-croaking/

版权

Leetcode 专栏收录该内容

84 篇文章 1 订阅

订阅专栏

class Solution {
public:
    int minNumberOfFrogs(string croakOfFrogs) {
        int c = 0, r = 0, o = 0, a = 0, k = 0, ans = 0;
        for(char x : croakOfFrogs){
            if(x == 'c') c += 1;
            else if(x == 'r') r += 1;
            else if(x == 'o') o += 1;
            else if(x == 'a') a += 1;
            else if(x == 'k') k += 1;
            else return -1;
            if(r > c or o > r or a > o or k > a) return -1;
            ans = max(c, ans);
            if(k == 1){
                c -= 1;
                r -= 1;
                o -= 1;
                a -= 1;
                k -= 1;
            }
        }
        if(c) return -1;
        return ans;
    }
};

class Solution {
    int at[10];
public:
    int minNumberOfFrogs(string croakOfFrogs) {
        int l = croakOfFrogs.length();
        memset(at, 0, sizeof(at));
        for (char c: croakOfFrogs){
            int cur;
            if (c == 'c') cur = 0;
            else if (c == 'r') cur = 1;
            else if (c == 'o') cur = 2;
            else if (c == 'a') cur = 3;
            else if (c == 'k') cur = 4;
            if (cur == 0){
                if (at[4] > 0)
                    --at[4];
                ++at[0];
            }else {
                if (!at[cur - 1]) return -1;
                --at[cur - 1], ++at[cur];
            }
        }
        for (int i = 0; i < 4; ++i)
            if (at[i] > 0)return -1;
        return at[4];
    }
};