leetcode 1663. Smallest String With A Given Numeric Value（具有给定数值的最小字符串）

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.

The numeric value of a string consisting of lowercase characters is defined as the sum of its characters’ numeric values. For example, the numeric value of the string “abe” is equal to 1 + 2 + 5 = 8.

You are given two integers n and k. Return the lexicographically smallest string with length equal to n and numeric value equal to k.

Note that a string x is lexicographically smaller than string y if x comes before y in dictionary order, that is, either x is a prefix of y, or if i is the first position such that x[i] != y[i], then x[i] comes before y[i] in alphabetic order.

Example 1:

Input: n = 3, k = 27
Output: “aay”
Explanation: The numeric value of the string is 1 + 1 + 25 = 27, and it is the smallest string with such a value and length equal to 3.

Example 2:

Input: n = 5, k = 73
Output: “aaszz”

给一个n，一个k，n表示字符串中要有n个字母，k表示这n个字母的和。
其中a～z字母的取值为1～26。
返回的字符串中字母要从小到大排列（字典顺序）。

思路：
Greedy
因为字母要从小到大排列，所以从最右到左尽量放最大的字母即可，直到k==0。

因为字符串要长度n，且最小字母为a，那就先初始化一个长度为n，全是a的字符串。

比如Example1, n=3, k = 27, 初始化为"aaa"

因为字符串中已经填入了3个a，所以k要-3，于是k=27-3=24。

然后从最右边开始，最大能放z，也就是26；但是一开始已经放了a，并把a减掉了，所以放z的话只能再减25（后面每个字母都要减去a），
k比25小的话直接放k就行。

如果k>25，放了z还有剩下的，那就再往左移一步，重复上面的过程，直到k==0。
因为题目中n <= k <= 26 * n，所以一定有符合的字符串。

    public String getSmallestString(int n, int k) {
        char[] chs = new char[n];
        
        Arrays.fill(chs, 'a');
        k -= n;
        
        for(int i = n - 1; i >= 0; i --) {
            if(k <= 0) break;
            chs[i] = (char)(chs[i] + Math.min(25, k));
            k -= Math.min(25, k);
        }
        
        return new String(chs);
    }