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

530.二叉搜索树的最小绝对差 python迭代法没有取abs

Browse Source
This commit is contained in:
大林程序员
2022-09-04 17:39:00 +08:00
committed by GitHub
parent c59b354990
commit ef0cb55638
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -233,7 +233,7 @@ class Solution:
else: # 逐一处理节点 else: # 逐一处理节点
cur = stack.pop() cur = stack.pop()
if pre: # 当前节点和前节点的值的差值 if pre: # 当前节点和前节点的值的差值
result = min(result, cur.val - pre.val) result = min(result, abs(cur.val - pre.val))
pre = cur pre = cur
cur = cur.right cur = cur.right
return result return result