没搞懂最快的加法应该怎么写
class Solution {
public:
int leastInterval(vector<char>& tasks, int n) {
int size=tasks.size();
if(size==1) return 1;
vector<int> time(26,0);
int ma=0,x=0,i;
if(size<42)
{
for(auto it:tasks)
{
i=it-'A';
++time[i];
if(time[i]>ma)
{
ma=time[i];
x=1;
}else if(time[i]==ma){
++x;
}
}
}else{
for(auto it:tasks)
{
++time[it-'A'];
}
for(auto it:time)
{
if(it>ma)
{
ma=it;
x=1;
}else if(it==ma){
++x;
}
}
}
return max(size,(n+1)*(ma-1)+x);
}
};