Skip to content

problem6.md

Latest commit

 

History

History
13 lines (10 loc) · 804 Bytes

problem6.md

File metadata and controls

13 lines (10 loc) · 804 Bytes

Problem 6: Lexicographical Decimation (Remove Duplicates from Sorted Array)

Problem Statement

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. Return k after placing the final result in the first k slots of nums.

Input Format

  • A sorted array of integers nums.

Example

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