LeetCode482. License Key Formatting

最新推荐文章于 2024-07-24 17:52:56 发布

tigerhuli

最新推荐文章于 2024-07-24 17:52:56 发布

阅读量118

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/m0_37518259/article/details/104586746

版权

LeetCode 专栏收录该内容

503 篇文章 3 订阅

订阅专栏

本文介绍了一种算法，用于将包含字母数字字符和破折号的许可密钥字符串重新格式化，使其每组包含恰好K个字符，除了可能较短的第一组。详细解释了如何移除多余的破折号，转换所有小写字母为大写，并在每两组之间插入破折号。

摘要由CSDN通过智能技术生成

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.

Example 1:

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.

Example 2:

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.

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.

class Solution {
public:
	string licenseKeyFormatting(string S, int K) {
		if (S.size() == 0) return "";
		int count = 0;
		for(char c:S){
			if (c != '-') count++;
		}
		string ans = "";
		int idx = K - count % K;
		int first = idx;
		for (char c : S) {
			if (c == '-') continue;
			if (idx % K == 0 && idx != first) ans += '-';
			idx++;
			ans += toupper(c);
		}
		return ans;
	}
};