algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新0530.二叉搜索树的最小绝对值差.md迭代Java注释

Browse Source
This commit is contained in:
ironartisan
2021-09-07 10:29:23 +08:00
parent 5769c6c7e3
commit 300f4a32d1
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
problems/0530.二叉搜索树的最小绝对差.md
View File

@ -184,15 +184,15 @@ class Solution {
int result = Integer.MAX_VALUE; int result = Integer.MAX_VALUE;
while (cur != null || !stack.isEmpty()) { while (cur != null || !stack.isEmpty()) {
if (cur != null) { if (cur != null) {
stack.push(cur); stack.push(cur); // 将访问的节点放进栈
cur = cur.left; // 左节点入栈 cur = cur.left; // 左
}else { }else {
cur = stack.pop(); // 右节点入栈 cur = stack.pop();
if (pre != null) { if (pre != null) { // 中
result = Math.min(result, cur.val - pre.val); result = Math.min(result, cur.val - pre.val);
} }
pre = cur; pre = cur;
cur = cur.right; cur = cur.right; // 右
} }
} }
return result; return result;