DataStructures-And-Algorithms/two pointers.cpp at master · Akhilleshgoswami/DataStructures-And-Algorithms · 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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
Two pointes

delete all the duplicate form the sorted array

        set<int>s;
        for(int i=0;i<nums.size();i++){
s.insert(nums[i]);
        }
        nums.clear();
        for(auto i:s){

        nums.push_back(i);};
        return s.size();
    }


    if(nums.lenght==0)return 0;
        int j = 0;
        for(int i=1;i<nums.size();i++){
            if(nums[i]!=nums[j]){
                j++;
            nums[j]=nums[i];}
}
        return i+1;}


2)three sum  = 0;

            (Zero tripalte)

 vector<vector<int>> res;
        sort(num.begin(), num.end());

        // moves for a
        for (int i = 0; i < (int)(num.size())-2; i++) {

            if (i == 0 || (i > 0 && num[i] != num[i-1])) {

                int lo = i+1, hi = (int)(num.size())-1, sum = 0 - num[i];

                while (lo < hi) {
                    if (num[lo] + num[hi] == sum) {

                        vector<int> temp;
                        temp.push_back(num[i]);
                        temp.push_back(num[lo]);
                        temp.push_back(num[hi]);
                        res.push_back(temp);

                        while (lo < hi && num[lo] == num[lo+1]) lo++;
                        while (lo < hi && num[hi] == num[hi-1]) hi--;

                        lo++; hi--;
                    }
                    else if (num[lo] + num[hi] < sum) lo++;
                    else hi--;
               }
            }
        }
        return res;


2 ) mex consecutive ones
int count = 0;
        int maxi = 0;
        for(int i =0;i<nums.size();i++){
            if(nums[i]==1)
                count++;
            else count = 0;
            maxi  = max(maxi,count);
        }

        return maxi;
    }