注册码的格式化 License Key Formatting

最新推荐文章于 2021-02-03 10:01:15 发布

weixin_34381687

最新推荐文章于 2021-02-03 10:01:15 发布

阅读量198

点赞数

原文链接：https://my.oschina.net/liyurong/blog/1603732

版权

为什么80%的码农都做不了架构师？>>>

问题：

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.

解决：

对注册码进行格式化，正确的注册码的格式是每四个字符后面跟一个短杠，每一部分的长度为K，第一部分长度可以小于K，另外，字母必须是大写的。那么由于第一部分可以不为K，那么我们可以反过来想，我们从S的尾部往前遍历，把字符加入结果res，每K个后面加一个短杠，那么最后遍历完再把res翻转一下即可，注意翻转之前要把结尾的短杠去掉(如果有的话)

① 从S的尾部往前遍历，把字符加入结果res，每K个后面加一个短杠，那么最后遍历完再把res翻转一下即可，注意翻转之前要把结尾的短杠去掉(如果有的话)。

class Solution { //29ms
public String licenseKeyFormatting(String S, int K) {
StringBuilder sb = new StringBuilder();
int count = 0;
int len = S.length();
for (int i = len - 1;i >= 0;i --){
char c = S.charAt(i);
if (c == '-') continue;
if (c >= 'a' && c <= 'z') c -= 32;
sb.append(c);
if (++ count % K == 0) sb.append("-");
}
if (sb != null && sb.length() != 0 && sb.charAt(sb.length() - 1) == '-') {
sb.deleteCharAt(sb.length() - 1);
}
String res = sb.reverse().toString();
return res;
}
}

② 使用数组存储结果。

class Solution {//12ms
public String licenseKeyFormatting(String S, int K) {
char[] schar = S.toCharArray();
int dashes = 0;
for (char c : schar){
if (c == '-') dashes ++;
}
int alphaNum = schar.length - dashes;
if (alphaNum == 0) return "";
double group = alphaNum / (double) K;
int groups = (int) group;
if (group != groups) groups ++;
int expected = groups - 1;//预计的“-”的个数
char[] res = new char[schar.length - dashes + expected];
int insert = res.length - 1;
int cur = schar.length - 1;
int count = 0;
while(cur >= 0){
if (schar[cur] == '-'){
cur --;
continue;
}
if (count == K){
res[insert --] = '-';
count = 0;
continue;
}
res[insert --] = Character.toUpperCase(schar[cur --]);
count ++;
}
return new String(res);
}
}