Remove Duplicates from Sorted Array

Easy

Given a sorted integer array nums, remove the duplicates in-place so each unique element appears once, and return the number of unique elements k.

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.