August 2, 2015
在http://zzk.cnblogs.com/ 用"找一找", 花了几个小时, 找出比较好的Leetcode博客．
Read the leetcode question and solutions:
1. Find lowest common ancestor in binary tree:
blog of a facebook programmer working on leetcode questions:
递归版本：空间O(1)，时间O(n)
http://www.cnblogs.com/chkkch/archive/2012/11/26/2788795.html
Try it myself and compare to solutions in my blog:
http://juliachencoding.blogspot.ca/2015/07/leetcode-lowest-common-ancestor-in.html
2. Reverse nodes in k group
http://www.cnblogs.com/lichen782/p/leetcode_Reverse_Nodes_in_kGroup.html
http://www.cnblogs.com/grandyang/p/4606710.html
3. binary tree
http://www.cnblogs.com/wwwjieo0/p/3891037.html
4. All 158 leetcode algorithm implementation in git hub:
http://coolshell.cn/articles/1870.html
Leetcode solution on git hub (use this one more often, best answer, author profile: http://coolshell.cn/haoel)
https://github.com/haoel/leetcode/tree/master/algorithms
5. Leetcode using C#
https://github.com/xisuogu/LeetSharp/tree/master/LeetSharp
6. One more to read
http://blog.csdn.net/u014674776/article/category/2296455
辛苦了几个小时, 总算可以出门放松，打打网球，准备明日爬山了!