Problems

13. Remove Duplicates from Sorted Array

EasyTwo PointersMicrosoftGoogle

Given an array nums sorted in non-decreasing order, remove duplicates in place so each element appears once, and return the new length.

Example 1:

Input: nums = [1,1,2]
Output: 2

Example 2:

Input: nums = [0,0,1,1,1,2,2,3,3,4]
Output: 5

Constraints:

  • 1 <= nums.length <= 3 * 10^4
  • nums is sorted in non-decreasing order.
Core code mode
● Auto-savedLine 1, column 1