merge hex108's code

Author: soulmachine

C++/LeetCodet题解(C++版).pdf

@@ -109,17 +109,18 @@ \subsubsection{代码1}
 \begin{Code}
 // LeetCode, Remove Duplicates from Sorted Array II
 // 时间复杂度O(n)，空间复杂度O(1)
+// @author hex108 (https://github.com/hex108)
 class Solution {
 public:
     int removeDuplicates(int A[], int n) {
-        if(n <= 2) return n;
-        
+        if (n <= 2) return n;
+
         int index = 2;
-        for(int i = 2; i < n; i ++){
-            if(A[i] != A[index - 2])
-                A[index ++] = A[i];
+        for (int i = 2; i < n; i++){
+            if (A[i] != A[index - 2])
+                A[index++] = A[i];
         }
-        
+
         return index;
     }
 };