Java solution beats 94% of submissions


  • 0
    V

    public class Solution {
    public int removeDuplicates(int[] nums) {
    int count = 1;
    for(int i=0;i<nums.length-1;i++)
    {
    if(nums[i] == nums[i+1])
    continue;
    else
    {
    nums[count] = nums[i+1];
    count++;
    }
    }
    return count;
    }
    }


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.