Commit0dda3d5

committed

refactor 99

1 parent02c6a76 commit0dda3d5Copy full SHA for 0dda3d5

File tree

+38

-2

lines changed

+38

-2

lines changed

Lines changed: 38 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,8 +7,44 @@`
`7`	`7`	`* Two elements of a binary search tree (BST) are swapped by mistake.`
`8`	`8`	`* Recover the tree without changing its structure.`
`9`	`9`
`10`		`- Note:`
`11`		`- A solution using O(n) space is pretty straight forward. Could you devise a constant space solution?`
	`10`	`+ Example 1:`
	`11`	`+`
	`12`	`+ Input: [1,3,null,null,2]`
	`13`	`+`
	`14`	`+ 1`
	`15`	`+ /`
	`16`	`+ 3`
	`17`	`+ \`
	`18`	`+ 2`
	`19`	`+`
	`20`	`+ Output: [3,1,null,null,2]`
	`21`	`+`
	`22`	`+ 3`
	`23`	`+ /`
	`24`	`+ 1`
	`25`	`+ \`
	`26`	`+ 2`
	`27`	`+ Example 2:`
	`28`	`+`
	`29`	`+ Input: [3,1,4,null,null,2]`
	`30`	`+`
	`31`	`+ 3`
	`32`	`+ / \`
	`33`	`+ 1 4`
	`34`	`+ /`
	`35`	`+2`
	`36`	`+`
	`37`	`+ Output: [2,1,4,null,null,3]`
	`38`	`+`
	`39`	`+ 2`
	`40`	`+ / \`
	`41`	`+ 1 4`
	`42`	`+ /`
	`43`	`+3`
	`44`	`+`
	`45`	`+ Follow up:`
	`46`	`+ A solution using O(n) space is pretty straight forward.`
	`47`	`+ Could you devise a constant space solution?`
`12`	`48`	`*/`
`13`	`49`
`14`	`50`	`publicclass_99 {`

Comments

(0)