Remove Duplicates from Sorted Array

Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place such that eachelement appear onlyOnceAnd return the new length.

Do not allocate extra space for another array, you must do this in placewith constant memory.

For example,
Given input array A = [1, 1, 2],

Your function shocould return length = 2, and A is now [1, 2].

HideTags

Array Two Pointers

 

 

 

# Pragma once # include

 
  
Using namespace std; int removeDuplicates (int A [], int n) {if (n = 1) return n; if (n = 0) return NULL; int p = 0; int pp = 0; int count = 1; // records the number of different elements. The position A [0] is not detected, so 1 while (pp <n) {if (A [pp]! = A [p]) {A [++ p] = A [pp]; count ++;} pp ++;} return count ;} void main () {system ("pause ");}