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

2022-09-04 17:39:00 +08:00 · 2022-09-04 17:39:00 +08:00 · ef0cb55638
parent c59b354990
commit ef0cb55638
1 changed files with 1 additions and 1 deletions
--- a/problems/0530.二叉搜索树的最小绝对差.md
+++ b/problems/0530.二叉搜索树的最小绝对差.md
@ -233,7 +233,7 @@ class Solution:
            else: # 逐一处理节点
                cur = stack.pop()
                if pre: # 当前节点和前节点的值的差值
-                    result = min(result, cur.val - pre.val)
+                    result = min(result, abs(cur.val - pre.val))
                pre = cur
                cur = cur.right
        return result