Competitive_Programming/LeetCode/Full_List/220.cpp at master · Ravi-Maurya/Competitive_Programming · 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
typedef long long int ll;
class Solution {
public:
    bool check(map<ll,ll>& mp, ll x, ll t){
        if(mp.size()==0)
            return false;
        auto it = mp.lower_bound(x);
        if(it!=mp.end()){
            if(abs(it->first - x)<=t)
                return true;
            it--;
            if(it!=mp.end() && abs(it->first - x)<=t)
                return true;
        }
        else{
            it--;
            return abs(it->first - x)<=t;
        }
        return false;
    }
    bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {
        if(nums.size()<2 || t<0 || k<=0)
            return false;
        map<ll,ll> mp;
        for(int i=0; i<k; i++){
            if(check(mp,nums[i],t))
                return true;
            mp[nums[i]]++;
        }
        for(int i=k; i<nums.size(); i++){
            if(check(mp,nums[i],t))
                return true;
            mp[nums[i]]++;
            mp[nums[i-k]]--;
            if(mp[nums[i-k]] <= 0)
                mp.erase(nums[i-k]);
        }
        return false;
    }
};