Home
Algorithms Data Structures Interview Experiences
Amazon Google Facebook Microsoft Apple Netflix
Play 2048 How to

LeetCode Solutions

482. License Key Formatting

Time: $O(n)$

Space: $O(n)$

			


class Solution {
 public:
  string licenseKeyFormatting(string S, int K) {
    string ans;
    int length = 0;

    for (int i = S.length() - 1; i >= 0; --i) {
      if (S[i] == '-')
        continue;
      if (length > 0 && length % K == 0)
        ans += "-";
      ans += toupper(S[i]);
      ++length;
    }

    reverse(begin(ans), end(ans));
    return ans;
  }
};




			


class Solution {
  public String licenseKeyFormatting(String S, int K) {
    StringBuilder sb = new StringBuilder();
    int length = 0;

    for (int i = S.length() - 1; i >= 0; --i) {
      if (S.charAt(i) == '-')
        continue;
      if (length > 0 && length % K == 0)
        sb.append('-');
      sb.append(Character.toUpperCase(S.charAt(i)));
      ++length;
    }

    return sb.reverse().toString();
  }
}