mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
33 lines
1.6 KiB
HTML
33 lines
1.6 KiB
HTML
<p>You are given a license key represented as a string <code>s</code> that consists of only alphanumeric characters and dashes. The string is separated into <code>n + 1</code> groups by <code>n</code> dashes. You are also given an integer <code>k</code>.</p>
|
|
|
|
<p>We want to reformat the string <code>s</code> such that each group contains exactly <code>k</code> characters, except for the first group, which could be shorter than <code>k</code> but still must contain at least one character. Furthermore, there must be a dash inserted between two groups, and you should convert all lowercase letters to uppercase.</p>
|
|
|
|
<p>Return <em>the reformatted license key</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "5F3Z-2e-9-w", k = 4
|
|
<strong>Output:</strong> "5F3Z-2E9W"
|
|
<strong>Explanation:</strong> 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.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "2-5g-3-J", k = 2
|
|
<strong>Output:</strong> "2-5G-3J"
|
|
<strong>Explanation:</strong> 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.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 10<sup>5</sup></code></li>
|
|
<li><code>s</code> consists of English letters, digits, and dashes <code>'-'</code>.</li>
|
|
<li><code>1 <= k <= 10<sup>4</sup></code></li>
|
|
</ul>
|