LeetCode 482. License Key Formatting

最新推荐文章于 2024-12-05 07:15:00 发布

原创最新推荐文章于 2024-12-05 07:15:00 发布 · 1.4k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

LeetCode

本文介绍了一种算法，用于将给定的软件许可密钥格式化为特定格式。该算法会将所有小写字母转换为大写，并按照指定长度K重新分组，使用短横线进行分隔。

Description

Now you are given a string S, which represents a software license key which we would like to format. The string S is composed of alphanumerical characters and dashes. The dashes split the alphanumerical characters within the string into groups. (i.e. if there are M dashes, the string is split into M+1 groups). The dashes in the given string are possibly misplaced.

We want each group of characters to be of length K (except for possibly the first group, which could be shorter, but still must contain at least one character). To satisfy this requirement, we will reinsert dashes. Additionally, all the lower case letters in the string must be converted to upper case.

So, you are given a non-empty string S, representing a license key to format, and an integer K. And you need to return the license key formatted according to the description above.

Example 1:

Input: S = "2-4A0r7-4k", K = 4

Output: "24A0-R74K"

Explanation: The string S has been split into two parts, each part has 4 characters.

Example 2:

Input: S = "2-4A0r7-4k", K = 3

Output: "24-A0R-74K"

Explanation: The string S has been split into three parts, each part has 3 characters except the first part as it could be shorter as said above.

Note:

The length of string S will not exceed 12,000, and K is a positive integer.
String S consists only of alphanumerical characters (a-z and/or A-Z and/or 0-9) and dashes(-).
String S is non-empty.

Code

class Solution {
public:
    string licenseKeyFormatting(string S, int K) {
        if (S.empty()) return S;
        for (int i = 0; i < S.size(); i++)
            if (S[i] == '-'){
                S.erase(i,1);
                i--;
            }else if (S[i] > 96){
                S[i] -= 32;
            }
        int n = S.size(), e = n % K;
        if (n <= K) return S;
        if (e != 0){
            S.insert(e, 1, '-');
        }
        else e--;
        for (int i = 0; i < n / K - 1; i++){
            e += K + 1;
            S.insert(e, 1, '-');
        }
        return S;
    }
};