leetcode

0 class Solution {

1 public:

2 string getSmallestString(string &s, int k) const {

3 for (int i = 0; i < size(s) && k > 0; ++i) {

4 int dist = min(s[i] - 'a', 'z' - s[i] + 1);

5 s[i] = dist <= k ? 'a' : s[i] - k;

6 k -= dist;

7 }

8 return s;

9 }

10 };