Commit 37d12a1

authored

Update 0530.二叉搜索树的最小绝对差.md

增加python - 双指针法,不用数组 (同Carl写法) - 更快

1 parent 76fd68c commit 37d12a1Copy full SHA for 37d12a1

File tree

+19

-0

lines changed

+19

-0

lines changed

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -221,8 +221,27 @@ class Solution:`
`221`	`221`	`for i in range(len(res)-1): // 统计有序数组的最小差值`
`222`	`222`	`r = min(abs(res[i]-res[i+1]),r)`
`223`	`223`	`return r`
	`224`	`+`
	`225`	`+`
	`226`	`+class Solution: # 双指针法,不用数组 (同Carl写法) - 更快`
	`227`	`+ def getMinimumDifference(self, root: Optional[TreeNode]) -> int:`
	`228`	`+ global pre,minval`
	`229`	`+ pre = None`
	`230`	`+ minval = 10**5`
	`231`	`+ self.traversal(root)`
	`232`	`+ return minval`
	`233`	`+`
	`234`	`+ def traversal(self,root):`
	`235`	`+ global pre,minval`
	`236`	`+ if not root: return None`
	`237`	`+ self.traversal(root.left)`
	`238`	`+ if pre and root.val-pre.val<minval:`
	`239`	`+ minval = root.val-pre.val`
	`240`	`+ pre = root`
	`241`	`+ self.traversal(root.right)`
`224`	`242`	```
`225`	`243`
	`244`	`+`
`226`	`245`	`迭代法-中序遍历`
`227`	`246`	```python
`228`	`247`	`class Solution:`

Comments

(0)