Leetcode 99: Recovery binary search tree 总算明白了算法, 把代码写清楚, 让错误无处可藏....

想写点什么, 因为这道题花了我好几个小时, 在周日, 除了在球场上跑了二个小时, 就泡在这道题上面.

read blogs:

http://www.lifeincode.net/programming/leetcode-recover-binary-search-tree-java/
http://www.cnblogs.com/AnnieKim/archive/2013/06/15/MorrisTraversal.html

C# implementations:

没有明白算法, 写了一个C#版本, 从读代码, 看有哪些不明白的地方. 
https://github.com/jianminchen/Leetcode_C-/blob/master/99RecoverBinarySearchTree.cs

简易递归版本, 但是, 找二个违例点不是很到位. 
https://github.com/jianminchen/Leetcode_C-/blob/master/99RecoverBinarySearchTreeB.cs

 

总算明白, 开始写几个小函数, 看能不能记住, 容易维护, 测试案例是不是很清楚. 比较满意的代码. 看看注释, 几个月过后, 希望能几分钟内回忆起算法. 
work on extracting small functions, and then, understand the algorithm better.
https://github.com/jianminchen/Leetcode_C-/blob/master/99RecoveryBinarySearchTree_C.cs

转载于:https://www.cnblogs.com/juliachenOnSoftware/p/4775354.html