網(wǎng)站開(kāi)發(fā)需要什么東西百度seo排名優(yōu)化費(fèi)用
力扣題-1.5
[力扣刷題攻略] Re:從零開(kāi)始的力扣刷題生活
力扣題1:482. 密鑰格式化
解題思想:首先先將破折號(hào)去除,并將所有字母轉(zhuǎn)換為大寫,然后計(jì)算第一組的長(zhǎng)度,進(jìn)行結(jié)果字符串的拼接,如果第一組的長(zhǎng)度為0,則需要?jiǎng)h除開(kāi)頭的’-'符號(hào)
class Solution(object):def licenseKeyFormatting(self, s, k):""":type s: str:type k: int:rtype: str"""s = s.replace("-", "").upper()first_group_length = len(s) % kresult = s[:first_group_length]for i in range(first_group_length, len(s), k):result += "-" + s[i:i+k]if not result[:first_group_length]:result = result[first_group_length+1:]return result
class Solution {
public:string licenseKeyFormatting(string s, int k) {// 去除破折號(hào)并將所有字母轉(zhuǎn)換為大寫s.erase(std::remove(s.begin(), s.end(), '-'), s.end());transform(s.begin(), s.end(), s.begin(), ::toupper);if (s == "") {return s;}int first_group_length = s.length() % k;std::string result = s.substr(0, first_group_length);for (int i = first_group_length; i < s.length(); i += k) {result += "-" + s.substr(i, k);}if (result.substr(0, first_group_length).empty()) {result = result.substr(first_group_length + 1);}return result;}
};