Looking for good programming challenges?

Use the search below to find our solutions for selected questions!

Remove Duplicates from Sorted Array

Problem Statement
Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

It doesn't matter what values are set beyond the returned length.
class Solution {
    public int removeDuplicates(int[] nums) {        
        int curr = 0;
        for (int i=1; i<nums.length; i++) {
            if (nums[i] != nums[curr]) {
                nums[curr] = nums[i];
        return curr+1;