结果:AC
代码:
class Solution {
public:
//长度为n,和为k
string getSmallestString(int n, int k) {
int left = 25;
vector<int> num(n,1);
k = k-n;
if(k == 0) return string(n,'a');
for(int i = n-1;i>=0;i--){
if(k<=left){
num[i] += k;
break;
}else{
k = k-left;
num[i] += left;
}
}
string ans;
for(int i:num){
ans += 'a' + i -1;
}
return ans;
}
};