1214. License Key Formatting

最新推荐文章于 2025-03-06 13:12:21 发布

原创最新推荐文章于 2025-03-06 13:12:21 发布 · 263 阅读

0 ·

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

刷题专栏收录该内容

215 篇文章

订阅专栏

博客围绕 License Key 字符串格式化展开，给定仅含字母数字和破折号的字符串 S 及数字 K，需按规则重新格式化，即每组含 K 个字符（首组可少于 K 但至少 1 个），组间加破折号且小写转大写，还给出了具体样例及遍历思路。

描述
You are given a license key represented as a string S which consists only alphanumeric character and dashes. The string is separated into N+1 groups by N dashes.
Given a number K, we would want to reformat the strings such that each group contains exactly K characters, except for the first group which could be shorter than K, but still must contain at least one character. Furthermore, there must be a dash inserted between two groups and all lowercase letters should be converted to uppercase.
Given a non-empty string S and a number K, format the string according to the rules described above.

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.

您在真实的面试中是否遇到过这个题？  是

样例
Input: S = "5F3Z-2e-9-w", K = 4
Output: "5F3Z-2E9W"
Explanation: The string S has been split into two parts, each part has 4 characters.
Note that the two extra dashes are not needed and can be removed.
Input: S = "2-5g-3-J", K = 2
Output: "2-5G-3J"
Explanation: The string S has been split into three parts, each part has 2 characters except the first part as it could be shorter as mentioned above.

倒着依次遍历就可以了。

class Solution {
public:
    /**
     * @param S: a string
     * @param K: a integer
     * @return: return a string
     */
    string licenseKeyFormatting(string &S, int K) {
        // write your code here
        string result;
        int tmp=0;
        for(int i=S.length()-1;i>=0;i--){
            if(S[i]=='-') continue;
            if(S[i]-'a'>=0&&S[i]-'a'<26)
                result=(char)('A'+S[i]-'a')+result;
            else result=S[i]+result;
            tmp++;
            if(tmp==K&&i!=0) {
                result='-'+result;
                tmp=0;
            }
        }
        return result;
    }
};