Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
AhkunTa
Arithmetic
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Arithmetic
/
LeetCode
/
98_javascript.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
80 lines (73 loc) · 1.64 KB
master
Breadcrumbs
Arithmetic
/
LeetCode
/
98_javascript.js
Copy path
Top
File metadata and controls
Code
Blame
80 lines (73 loc) · 1.64 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
76
77
78
79
80
// 给定一个二叉树,判断其是否是一个有效的二叉搜索树。
// 假设一个二叉搜索树具有如下特征:
// 节点的左子树只包含小于当前节点的数。
// 节点的右子树只包含大于当前节点的数。
// 所有左子树和右子树自身必须也是二叉搜索树。
// 示例 1:
// 输入:
// 2
// / \
// 1 3
// 输出: true
// 示例 2:
// 输入:
// 5
// / \
// 1 4
// / \
// 3 6
// 输出: false
// 解释: 输入为: [5,1,4,null,null,3,6]。
// 根节点的值为 5 ,但是其右子节点值为 4 。
// 注意题干
// 右子树的值要大于左子树
/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root
* @return {boolean}
*/
// 使用中序遍历 左 中 右
// 深度优先 DFS
var isValidBST = function (root) {
let pre = -Infinity;
let dfs = node => {
if (!node) {
return true;
}
// 遍历左子树
if (!dfs(node.left)) {
return false;
}
if (pre >= node.val) {
return false;
}
pre = node.val;
return dfs(node.right);
};
return dfs(root);
};
// 不使用递归
var isValidBST = function (root) {
let pre = -Infinity;
let tempArr = [];
while (root || tempArr.length) {
while (root) {
tempArr.push(root);
root = root.left;
}
root = tempArr.pop();
if (root.val <= pre) {
return false;
}
pre = root.val;
root = root.right;
}
return true;
};
You can’t perform that action at this time.