【LeetCode】第339场周赛

2609. 最长平衡子字符串
简单模拟

class Solution {
public:
    int findTheLongestBalancedSubstring(string s) {
        int zero=0,one=0,ans=0,pre=0;
        for(int i = 0;i < s.length();i++){
            if(s[i]=='0'){
                one=0;
                zero++;
            }
            else{
                if(i!=0&&s[i-1]=='0'){
                     pre=zero;
                     zero=0;
                }
                
                one++;
                if(one<=pre) ans = max(ans,2*(one));
            }
        }
        return ans;
    }
};

2610. 转换二维数组

class Solution {
public:
    vector<vector<int>> findMatrix(vector<int>& nums) {
        int n = nums.size(),i,j;
        vector<int> s(n+1);
        for(auto &c : nums) s[c]++;
        int m = *max_element(s.begin(),s.end());//找出s中最大的那个数
        vector<vector<int>> res(m); //一共m个数组
        for(int i = 0;i < m;i++){
            for(int j = 1;j <= n;j++){
                if(s[j]){//s[j]还没用完
                    res[i].push_back(j);
                    s[j]--;
                }
            }
        }
        return res;
    }
};