LeetCode 26

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.

나의 코드 1

/**
 * @param {number[]} nums
 * @return {number}
 */
var removeDuplicates = function (nums) {
  let unique = 0;

  for (let i = 1; i < nums.length; i++) {
    if (nums[unique] !== nums[i]) {
      nums[++unique] = nums[i];
    }
  }

  // array 의 unique 값들만으로 구성된 부분까지의 길이를 return 해야함
  return unique + 1;
};

참고 코드

배운점