Remove-Duplicates-from-Sorted-Array/Java at main · vinayak302004/Remove-Duplicates-from-Sorted-Array · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
# Java

1. Brute-Force Approach :

class Solution
{
    public int removeDuplicates(int[] nums)
    {
        int i,k=1,n=nums.length;
        for(i=1;i<n;i++)
        {
            if(nums[i-1]!=nums[i])
            {
                nums[k]=nums[i];
                k++;
            }
        }
        return k;
    }
}

2. Optimal Approach :

class Solution
{
    public int removeDuplicates(int[] nums)
    {
       HashSet<Integer> set=new HashSet<>();
       int k=0;
       for(int num:nums)
       {
            if(set.add(num))
            {
                nums[k++]=num;
            }
       }
       return k;
    }
}