1214. License Key Formatting

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

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

描述

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;
    }
};

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值