搜索结果
查询Tags标签： rightmin，共有 4条记录-
[LeetCode] 98. Validate Binary Search Tree
Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows:The left subtree of a node contains only nodes with keys less than the nodes key. The right subtree of a node contains only nodes w…
2022/1/9 6:07:01 人评论 次浏览 -
[LeetCode] 98. Validate Binary Search Tree
Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows:The left subtree of a node contains only nodes with keys less than the nodes key. The right subtree of a node contains only nodes w…
2022/1/9 6:07:01 人评论 次浏览 -
算法中的预处理操作
打表 题目打两个表，分别记录左侧的最大值以及右侧的最小值。 #include<bits/stdc++.h> #define inf 0x3f3f3f3f using namespace std; const int maxn=100010; int a[maxn],n; int leftmax[maxn]; int rightmin[maxn]; vector<int> re; int main() {memset(l…
2021/9/9 14:34:03 人评论 次浏览 -
算法中的预处理操作
打表 题目打两个表，分别记录左侧的最大值以及右侧的最小值。 #include<bits/stdc++.h> #define inf 0x3f3f3f3f using namespace std; const int maxn=100010; int a[maxn],n; int leftmax[maxn]; int rightmin[maxn]; vector<int> re; int main() {memset(l…
2021/9/9 14:34:03 人评论 次浏览
