leetcode 1663. Smallest String With A Given Numeric Value

最新推荐文章于 2023-02-02 02:30:00 发布

田园诗人之园

最新推荐文章于 2023-02-02 02:30:00 发布

阅读量277

点赞数

分类专栏： leetcode 文章标签： leetcode 1663 leetcode

本文链接：https://blog.csdn.net/u014100559/article/details/110010433

版权

字符串算法数值计算 C++ 最小化字符操作

关键词由CSDN通过智能技术生成

leetcode 专栏收录该内容

120 篇文章 11 订阅

订阅专栏

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"

Constraints:

1 <= n <= 105
n <= k <= 26 * n

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/smallest-string-with-a-given-numeric-value
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

char * getSmallestString(int n, int k){
    k -= n;
    char *res = (char *)malloc(sizeof(char) * (n + 1));
    memset(res, 'a', n + 1);
    int freq_z = k / 25;
    int neast_z = k % 25;

    res[n] = '\0';
    for (int i = 0; i < freq_z; i++) {
        res[n - i - 1] += 25;
    }
    res[n - freq_z - 1] += neast_z;
    printf("res:%s\n", res);

    return res;
}

C++

class Solution {
public:
    string getSmallestString(int n, int k) {
        k -= n;
        string res(n, 'a');
        for (int index = n - 1; index >= 0; index--) {
            int d = min(k, 25);
            res[index] += d;
            k -= d;
        }
        return res;
    }
};