(1)矩阵
class Solution {
public:
int leastInterval(vector<char>& tasks, int n) {
unordered_map<char,int> mp;
for(int i=0;i<tasks.size();i++) {
mp[tasks[i]]++;
}
int maxs=INT_MIN,count=0;
for(auto it=mp.begin();it!=mp.end();it++) {
if(maxs<it->second) {
maxs=it->second;
count=1;
} else if(maxs==it->second) {
count++;
}
}
return max((maxs-1)*(n+1)+count,(int)tasks.size());
}
};