Commit 5cbb991

authored

Merge pull request youngyangyang04#2072 from Lozakaka/patch-8

adding java iteration method

2 parents eb91a26 + c76ed37 commit 5cbb991Copy full SHA for 5cbb991

File tree

+42

-0

lines changed

+42

-0

lines changed

Lines changed: 42 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -248,6 +248,8 @@ public:`
`248`	`248`
`249`	`249`	`## Java`
`250`	`250`
	`251`	`+递归`
	`252`	`+`
`251`	`253`	```Java
`252`	`254`	`class Solution {`
`253`	`255`	`public TreeNode trimBST(TreeNode root, int low, int high) {`
`@@ -269,6 +271,46 @@ class Solution {`
`269`	`271`
`270`	`272`	```
`271`	`273`
	`274`	`+迭代`
	`275`	`+`
	`276`	+```Java
	`277`	`+class Solution {`
	`278`	`+ //iteration`
	`279`	`+ public TreeNode trimBST(TreeNode root, int low, int high) {`
	`280`	`+ if(root == null)`
	`281`	`+ return null;`
	`282`	`+ while(root != null && (root.val < low \|\| root.val > high)){`
	`283`	`+ if(root.val < low)`
	`284`	`+ root = root.right;`
	`285`	`+ else`
	`286`	`+ root = root.left;`
	`287`	`+ }`
	`288`	`+`
	`289`	`+ TreeNode curr = root;`
	`290`	`+`
	`291`	`+ //deal with root's left sub-tree, and deal with the value smaller than low.`
	`292`	`+ while(curr != null){`
	`293`	`+ while(curr.left != null && curr.left.val < low){`
	`294`	`+ curr.left = curr.left.right;`
	`295`	`+ }`
	`296`	`+ curr = curr.left;`
	`297`	`+ }`
	`298`	`+ //go back to root;`
	`299`	`+ curr = root;`
	`300`	`+`
	`301`	`+ //deal with root's righg sub-tree, and deal with the value bigger than high.`
	`302`	`+ while(curr != null){`
	`303`	`+ while(curr.right != null && curr.right.val > high){`
	`304`	`+ curr.right = curr.right.left;`
	`305`	`+ }`
	`306`	`+ curr = curr.right;`
	`307`	`+ }`
	`308`	`+ return root;`
	`309`	`+ }`
	`310`	`+}`
	`311`	`+`
	`312`	+````
	`313`	`+`
`272`	`314`	`## Python`
`273`	`315`
`274`	`316`	`递归法(版本一)`

Comments

(0)