leetcode 443: String Compression，357: Count Numbers with Unique Digits

class Solution { public: int compress(vector<char>& chars) { int cur=0; //记录新数组中元素的位置 for(int i=0, j=0; i<chars.size(); i=j){ while(j<chars.size() && chars[i]==chars[j]

>>阅读原文<<