[OJ.leetcode] remove-duplicates-from-sorted-array

https://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in place with constant memory.

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

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

/* 똑같은 문제인 https://oj.leetcode.com/problems/remove-element/의 유사판 16라인 한줄만 고치고 accepted */ class Solution { public: int removeDuplicates(int A[], int n) { if(n <= 0) { return n; } int jumpCnt = 0; for(int i=0; i<n ; ++i) { while(i+jumpCnt+1 < n && A[i+jumpCnt] == A[i+jumpCnt+1]) { ++jumpCnt; } A[i] = A[i+jumpCnt]; } return n-jumpCnt; } };