Leetcode first _ Remove Duplicates from Sorted Array II

Question.

I have said that it is difficult to include at least a few questions. You can repeat at a maximum of two times to repeat the task. Otherwise, you can simply move forward based on the number of repetitions, just like normal data. However, this inspace idea is still useful. The fatal disadvantage of array implementation is that it is too costly to delete or add Intermediate elements, because it is difficult to grasp the final position of data. This is a case. merging two sorted arrays is also an example.

Class Solution {public: int removeDuplicates (int A [], int n) {int past = A [0], due = 0, tpdue = 1; for (int I = 1; I <n; I ++) {if (A [I] = past) {tpdue ++; if (tpdue> 2) {due ++ ;} else {A [I-due] = A [I] ;}} else {past = A [I]; A [I-due] = A [I]; tpdue = 1 ;}}return n-due ;}};