【LeetCode】二叉查找树 binary search tree(共14题)
链接:https://leetcode.com/tag/binary-search-tree/
【220】Contains Duplicate III (2019年4月20日) (好题)
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute difference between i and j is at most k.
Example 1:
Input: nums = [1,2,3,1], k = 3, t = 0
Output: true
Example 2:
Input: nums = [1,0,1,1], k = 1, t = 2
Output: true
Example 3:
Input: nums = [1,5,9,1,5,9], k = 2, t = 3
Output: false
题解:
解法1. brute force。 O(NK)
解法2. set + lower_bound(), sliding window, time complexity: O(NlogK), space O(K)
解法3. bucket:unordered_map<int, int> : key bucket idx, value nums[i], time complexity: O(N), space: O(K)
class Solution {
public:
bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {
if (k <= || t < ) {return false;}
set<int> st;
for (int i = ; i < nums.size(); ++i) {
int num = nums[i];
auto iter = st.lower_bound(num);
if (iter != st.end()) {
int greater = *iter;
if ((long)greater - num <= t) {return true;}
}
if (iter != st.begin()) {
--iter;
int less = *iter;
if ((long)num - less <= t) {return true;}
}
if (st.size() == k) {
st.erase(nums[i-k]);
}
st.insert(num);
}
return false;
}
};
solution2
class Solution {
public:
bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {
if (nums.empty() || k <= || t < ) {return false;}
long bucketSize = (long)t + ;
int minn = nums.front();
for (auto& num : nums) {
minn = min(num, minn);
}
unordered_map<long, int> bucket; //key: bucketIdx, value: nums[i]
for (int i = ; i < nums.size(); ++i) {
long bucketIdx = ((long)nums[i] - minn) / bucketSize;
if (bucket.count(bucketIdx)) {return true;}
int left = bucketIdx - , right = bucketIdx + ;
if (bucket.count(left) && (long)nums[i] - bucket[left] <= t) {return true;}
if (bucket.count(right) && (long)bucket[right] - nums[i] <= t) {return true;}
if (i >= k) {
long removeKey = ((long)nums[i-k] - minn) / bucketSize;
bucket.erase(removeKey);
}
bucket[bucketIdx] = nums[i];
}
return false;
}
};
solution3
【315】Count of Smaller Numbers After Self
【327】Count of Range Sum
【352】Data Stream as Disjoint Intervals
【493】Reverse Pairs
【530】Minimum Absolute Difference in BST (2019年3月10日)(Easy)
返回一棵 BST的两个结点的最小绝对值的距离之差。
Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.
题解:根据 BST 的性质,我们只需要用一个变量记录中序遍历的前一个结点prev即可。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int getMinimumDifference(TreeNode* root) {
if (!root) {return ;}
inorder(root);
return res;
}
int res = INT_MAX;
TreeNode* prev = nullptr;
void inorder(TreeNode* root) {
if (!root) {return;}
inorder(root->left);
if (prev) {
res = min(res, root->val - prev->val);
}
prev = root;
inorder(root->right);
return;
}
};
【683】K Empty Slots
【699】Falling Squares
【715】Range Module
【731】My Calendar II (2019年3月21日)
题意是每次给定一个 event [start, end) ,如果插入这个 event 之后, 当前有个时刻的同时进行的 event 的数量大于等于 3,那么就不插入这个 event,返回这个 event 能不能被插入。
此题只要找出所有与[start,end)重合的区间,再检查这些区间是否有互相的重合。是的话,说明必然有triple booking。
【732】My Calendar III (2019年3月21日)
题意是每次插入一个 event,返回插入这个event之后,对于任意一个时刻,同时在进行的 event 有多少个。
https://leetcode.com/problems/my-calendar-iii/description/
sweep line 的思想,用一个 multiset,记录 event 和 event 类型,如果是 start,event就表示成{start, 1}, 如果是 end,event 就表示成 {end, -1},然后每次插入之后,去遍历 multiset,如果碰到 1, 就 +1, 如果碰到 -1 ,就 -1。
【776】Split BST
【783】Minimum Distance Between BST Nodes (2019年3月10日)(Easy)
返回一棵 BST的两个结点的最小的距离之差。
Given a Binary Search Tree (BST) with the root node root
, return the minimum difference between the values of any two different nodes in the tree.
题解:同上面 530 题,一样的解法。
【938】Range Sum of BST
【LeetCode】二叉查找树 binary search tree(共14题)的更多相关文章
- LeetCode: Validata Binary Search Tree
LeetCode: Validata Binary Search Tree Given a binary tree, determine if it is a valid binary search ...
- [leetcode]Recover Binary Search Tree @ Python
原题地址:https://oj.leetcode.com/problems/recover-binary-search-tree/ 题意: Two elements of a binary searc ...
- 算法与数据结构基础 - 二叉查找树(Binary Search Tree)
二叉查找树基础 二叉查找树(BST)满足这样的性质,或是一颗空树:或左子树节点值小于根节点值.右子树节点值大于根节点值,左右子树也分别满足这个性质. 利用这个性质,可以迭代(iterative)或递归 ...
- [LeetCode] Validate Binary Search Tree 验证二叉搜索树
Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as ...
- [Leetcode] Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing ...
- LeetCode Closest Binary Search Tree Value II
原题链接在这里:https://leetcode.com/problems/closest-binary-search-tree-value-ii/ 题目: Given a non-empty bin ...
- LeetCode Closest Binary Search Tree Value
原题链接在这里:https://leetcode.com/problems/closest-binary-search-tree-value/ Given a non-empty binary sea ...
- [LeetCode] Closest Binary Search Tree Value II 最近的二分搜索树的值之二
Given a non-empty binary search tree and a target value, find k values in the BST that are closest t ...
- [LeetCode] Closest Binary Search Tree Value 最近的二分搜索树的值
Given a non-empty binary search tree and a target value, find the value in the BST that is closest t ...
随机推荐
- 电脑配置Java环境变量之后,在cmd中仍然无法识别
在电脑上配置了Java的环境变量,但是在cmd框中仍然无法识别: 解决方法:cmd.exe右键---以管理员身份运行,即可识别
- LuceneNET全文检索封装
一.源码特点 1. Lucene.net是Lucene的.net移植版本,是一个开源的全文检索引擎开发包,即它不是一个完整的全文检索引擎,而是一个全文检索引擎的架构,提供了完整的查询引擎 ...
- 逻辑回归模型(Logistic Regression, LR)--分类
逻辑回归(Logistic Regression, LR)模型其实仅在线性回归的基础上,套用了一个逻辑函数,但也就由于这个逻辑函数,使得逻辑回归模型成为了机器学习领域一颗耀眼的明星,更是计算广告学的核 ...
- 阶段1 语言基础+高级_1-3-Java语言高级_02-继承与多态_第7节 内部类_7_内部类的概念与分类
完整
- Delphi中堆栈区别
http://blog.csdn.net/zang141588761/article/details/52838728 Delphi中堆栈区别 2016-10-17 14:49 277人阅读 评论( ...
- vue组件父子间通信之综合练习--假的聊天室
<!doctype html> <html> <head> <meta charset="UTF-8"> <title> ...
- 20191103 《Spring5高级编程》笔记-第3章
第3章 在Spring中引入IoC和DI 依赖注入是IOC的一种特殊形式,尽管这两个术语经常可以互换使用. 3.1 控制反转和依赖注入 IOC的核心是DI,旨在提供一种更简单的机制来设置组件依赖项,并 ...
- Django密码错误报错提醒
aaarticlea/png;base64,iVBORw0KGgoAAAANSUhEUgAAAOwAAAIBCAYAAABKllNhAAAAAXNSR0IArs4c6QAAAARnQU1BAACxjw
- 解决ajax跨域几种方式
发生跨域问题的原因: 浏览器的限制,出于安全考虑.前台可以正常访问后台,浏览器多管闲事报跨域问题,但其实前台已经访问到后台了. 跨域,协议.域名.端口任何一个不一样浏览器就认为是跨域. XHR(XML ...
- oracle--权限的传递
sys 用户 普通授权lisi grant alter any table to lisi; 将权限指定admin ,可以权限传递给其他用户 grant alter any table to lisi ...