class Solution {
public:
bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {
int n = nums.size();
set<int> ret;
for(int i=0; i<nums.size(); i++){
auto iter = ret.lower_bound(max(nums[i], INT_MIN+t)-t);
if(iter!=ret.end() && *iter <= min(nums[i], INT_MAX-t)+t) return true;
ret.insert(nums[i]);
if(i>=k){
ret.erase(nums[i-k]);
}
}
return false;
}
};
56)二叉搜索树中两个节点之和
class Solution{
public:
bool findTarget(TreeNode* root, int k){
if(root==nullptr) return false;
unordered_set<int> nums;
stack<TreeNode*> stk;
TreeNode* cur = root;
while(cur!=nullptr || !stk.empty()){
while(cur!=nullptr){
stk.push(cur);
cur = cur->left;
}
cur = stk.top(); stk.pop();
if(nums.count(k-cur->val)) return true;
nums.insert(cur->val);
cur = cur->right;
}
return false;
}
};
58)日程表
class MyCalendar {
private:
map<int, int> calendar;
public:
MyCalendar() {
}
bool book(int start, int end) {
auto iter = calendar.lower_bound(start);
if(iter!=calendar.end() && iter->first < end) return false;
if(iter!=calendar.begin() && (--iter)->second > start) return false;
calendar[start] = end;
return true;
}
};