[LeetCode] Remove Duplicates from Sorted Array

문제

Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

Example 1:

Given nums = [1,1,2], Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn't matter what you leave beyond the returned length.

Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4], Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively. It doesn't matter what values are set beyond the returned length.

Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

Internally you can think of this:

// nums is passed in by reference. (i.e., without making a copy) int len = removeDuplicates(nums); // any modification to nums in your function would be known by the caller. // using the length returned by your function, it prints the first len elements. for (int i = 0; i < len; i++) {     print(nums[i]); }

 

Approach

Array를 수정하고 길이를 넘겨주면 길이만큼 array에서 print해서 답인지 확인하는 문제

그러므로 실제로 array erase등으로 값을 삭제할 필요는 없다.

원소를 제자리에 놓고 길이만 알려주면 되기 때문.

원소를 저장할 포인터 하나, array를 탐색하는 포인터 하나를 사용해서 풀면 된다.

 

Code

https://github.com/chi3236/algorithm/blob/master/LeetCode_RemoveDuplicatesFromSortedArray.cpp

불러오는 중입니다...