엔지니어 게시판
LeetCode 솔루션 분류

[Easy - wk2 - Q2] 26. Remove Duplicates from Sorted Array

컨텐츠 정보

본문

26. 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.

Custom Judge:

The judge will test your solution with the following code:

int[] nums = [...]; // Input array
int[] expectedNums = [...]; // The expected answer with correct length

int k = removeDuplicates(nums); // Calls your implementation

assert k == expectedNums.length;
for (int i = 0; i < k; i++) {
    assert nums[i] == expectedNums[i];
}

If all assertions pass, then your solution will be accepted.

 

Example 1:

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).

Example 2:

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).

 

Constraints:

  • 1 <= nums.length <= 3 * 104
  • -100 <= nums[i] <= 100
  • nums is sorted in non-decreasing order.

관련자료

댓글 5

yuun님의 댓글

  • 익명
  • 작성일
class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        cur = 0
        for i in range(1, len(nums)):
            if nums[cur] != nums[i]:
                cur+=1
                nums[cur] = nums[i]
          
        return cur+1

Chloe님의 댓글의 댓글

  • 익명
  • 작성일
        count = 0
        for i in range(len(nums)):
            if nums[i] != nums[count]:
                count+=1
                nums[count] = nums[i]
        return count+1

Jack님의 댓글

  • 익명
  • 작성일
pytnon

Runtime: 102 ms, faster than 70.67% of Python3 online submissions for Remove Duplicates from Sorted Array.
Memory Usage: 15.5 MB, less than 62.17% of Python3 online submissions for Remove Duplicates from Sorted Array.

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        if len(nums) == 0 : return 0
        if len(nums) == 1 : return 1
        
        x = 1
        
        for i in range(1, len(nums)):
            if nums[i] != nums[i-1]:
                nums[x] = nums[i]
                x += 1
        
        nums[:]=nums[:x]
        
        return x

dawn27님의 댓글

  • 익명
  • 작성일
var removeDuplicates = function(nums) {
 let output = nums.length;
  
  for (let i = 0; i < nums.length; i++) {
      if (nums[i] === nums[i+1]) {
          nums.splice(i, 1);
          output-=1;
          nums.length-1;
          i--;
      }
  }

  let nullCounter = output;
  while (nullCounter > 0) {
    nums.push(null);
    nullCounter-=1;
  }
  return output;
};

mingki님의 댓글

  • 익명
  • 작성일
C++
class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int n = nums.size();
        int index = 0;

        if (n == 0)
            return 0;
        for (int i = 1; i < n; i++)
            if (nums[i] != nums[index])
                nums[++index] = nums[i];
        return index + 1;
    }
};


Python
class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        counter = 0
        for i in range(1, len(nums)):
            if nums[counter] != nums[i]:
                nums[counter + 1], nums[i] = nums[i], nums[counter + 1]
                counter += 1
        return counter + 1 if nums else 0
전체 396 / 1 페이지
번호
제목
이름

최근글


인기글


새댓글


Stats


  • 현재 접속자 160 명
  • 오늘 방문자 2,329 명
  • 어제 방문자 6,462 명
  • 최대 방문자 11,134 명
  • 전체 회원수 1,050 명
알림 0