[LeetCode] Remove Duplicates from Sorted Array

[문제]

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same.

Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.

Return k after placing the final result in the first k slots of nums.

Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.

배열 nums에서 중복된 값들을 제외하고 길이를 return 시켜라.

 

[입출력 예]

Input: nums = [1,1,2]
Output: 2, nums = [1,2,_]
Explanation: Your function should return k = 2, with the first two elements of nums being 1 and 2 respectively.
It does not matter what you leave beyond the returned k (hence they are underscores).

Input: nums = [0,0,1,1,1,2,2,3,3,4]
Output: 5, nums = [0,1,2,3,4,_,_,_,_,_]
Explanation: Your function should return k = 5, with the first five elements of nums being 0, 1, 2, 3, and 4 respectively.
It does not matter what you leave beyond the returned k (hence they are underscores).

 

 

[답]

nums의 첫 번째 값을 temp에 저장을 해주었다.

후에 for문을 사용해서 temp의 값과 nums의 i번째 값을 비교해주었다.

temp와 nums의 값이 같지 않으면 temp의 값을 새롭게 저장해주고 index의 값을 더해주고 return 시켜주었다.