LeetCode-Solutions-in-Cpp17

Solutions to high-frequency interview questions of LeetCode in C++17, taking into account both efficiency and comprehensibility.

---

Project maintained by downdemo Hosted on GitHub Pages — Theme by mattgraham

class Solution {
 public:
  int compress(vector<char>& chars) {
    int sz = size(chars);
    int l = 0;
    int r = 0;
    int cur = 0;
    while (l != sz) {
      while (r < sz && chars[l] == chars[r]) {
        ++r;
      }
      chars[cur] = chars[l];
      if (r - l > 1) {
        string cnt = to_string(r - l);
        for (int i = 0; i < size(cnt); ++i) {
          chars[++cur] = cnt[i];
        }
      }
      l = r;
      ++cur;
    }
    return cur;
  }
};