Remove_Element/Java at main · vinayak302004/Remove_Element · 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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
# Java

1. Brute-Force Approach :

class Solution
{
    public int removeElement(int[] nums, int val)
    {
        int n=nums.length,i,count=0;
        for(i=0;i<n;i++)
        {
            if(nums[i]!=val)
            {
                nums[count]=nums[i];
                count++;
            }
        }
        return count;
    }
}

2. Optimal Approach (Two Pointer) :

class Solution
{
    public int removeElement(int[] nums, int val)
    {
        int s=0,n=nums.length,e=n-1,temp;
        while(s<=e)
        {
            if(nums[e]==val)
            {
                e--;
            }
            else
            {
                if(nums[s]==val)
                {
                    temp=nums[e];
                    nums[e]=nums[s];
                    nums[s]=temp;
                    s++;
                    e--;
                }
                else
                {
                    s++;
                }
            }
        }
        return e+1;
    }
}