diff --git a/code_segment/operator_reload.cpp b/code_segment/operator_reload.cpp
index f3efcf50..e41dfad6 100644
--- a/code_segment/operator_reload.cpp
+++ b/code_segment/operator_reload.cpp
@@ -2,6 +2,23 @@
 #include<vector>
 
 using namespace std;
+
+int compress(vector<char>& chars) {
+    vector<char> vec;
+    vector<int> num;
+    char lc=chars[0];
+    int ln=1;
+    int j=0;
+    for(int i=1;i<chars.size();i++){
+        if(chars[i]==lc){
+            ln++;
+        }
+        else{
+            vec[j]=lc;
+            num[j]=ln;
+            j++;
+            lc=chars[i];
+            ln=1;
 // 重载运算符。返回流本身，用于链式法则。如果需要访问私有变量
 // 需要声明为友元。一般不需要声明为友元。
 ostream & operator<<(ostream &os, const vector<int> temp)  
@@ -22,12 +39,37 @@ int main(){
           temp[arr[i]]=1;
         }
     }
-    int i;
-  	for(i=1;i<temp.size();i++){
-      if(temp[i]==0)break;
+    vec[j]=lc;
+    num[j]=ln;
+    vector<char> &res=chars;
+    res.clear();
+    for(int i=0;i<vec.size();i++){
+        res.push_back(vec[i]);
+        if(num[i]==1)continue;
+        if(num[i]>0){
+            char temp = char(num[i]%10-0+'0');
+            res.push_back(temp);
+            num[i]/=10;
+        }
     }
-    cout<<i<<endl;
+    return res.size();
+}
 
+<<<<<<< HEAD:a.cpp
+int main(){
+    vector<char> chars={'a','a','b'};
+    for(auto a:chars){
+        cout<<a<<endl;
+    }
+    compress(chars);
+
+    for(auto a:chars){
+        cout<<a;
+    }
+    cout<<endl;
+    return 0;
+}
+=======
 	return 0;
 }
 
@@ -35,3 +77,4 @@ int main(){
 
 // 测试一下友元
 
+>>>>>>> fb01b190883e115ab7560e5401aa57540e889977:code_segment/operator_reload.cpp