15 Jun 2024•C++ / Python / TypeScript•Easy

Remove Duplicates from Sorted Array

Collected C++, Python, TypeScript solutions for remove duplicates from sorted array. Add a dedicated write-up later if you want deeper notes.

View original LeetCode question

auto-generated entry for Remove Duplicates from Sorted Array. the solution files are available below.

solution files

C++ remove-duplicates-from-sorted-array/synced-solution.cpp
Python remove-duplicates-from-sorted-array/synced-solution.py
TypeScript remove-duplicates-from-sorted-array/synced-solution.ts

Solution files

Python•remove-duplicates-from-sorted-array/synced-solution.py

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        k = class="syntax-number">1
        for i in range(class="syntax-number">1, len(nums)):
            if nums[i] != nums[i-class="syntax-number">1]:
                nums[k] = nums[i]; k += class="syntax-number">1
        return k

C++•remove-duplicates-from-sorted-array/synced-solution.cpp

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int k = class="syntax-number">1;
        for (int i = class="syntax-number">1; i < nums.size(); i++)
            if (nums[i] != nums[i-class="syntax-number">1]) nums[k++] = nums[i];
        return k;
    }
};

TypeScript•remove-duplicates-from-sorted-array/synced-solution.ts

function removeDuplicates(nums: number[]): number {
    let k = class="syntax-number">1;
    for (let i = class="syntax-number">1; i < nums.length; i++)
        if (nums[i] !== nums[i-class="syntax-number">1]) nums[k++] = nums[i];
    return k;
}