09 2015 档案

Leetcode: Convert sorted list to binary search tree (No. 109)
摘要：Sept. 22, 2015学一道算法题, 经常回顾一下. 第二次重温, 决定增加一些图片, 帮助自己记忆. 在网上找他人的资料, 不如自己动手. 把从底向上树的算法搞通俗一些.先做一个例子:9/22/2015Go over one example to build some muscle memo... 阅读全文

posted @ 2015-09-24 12:45 juliachen 阅读(425) 评论(0) 推荐(0)

Morris post order traversal algorithm
摘要：Sept. 5, 2015花时间把代码读明白,比光看书强.动手写代码,改代码,兴趣是最好的老师. 多记几个例子, 增加情趣.举个例子关于中序遍历, 4 / \ 2 6 / \ / \ 1 3 5 7easy way to travel is to remem... 阅读全文

posted @ 2015-09-14 04:56 juliachen 阅读(298) 评论(0) 推荐(0)

Backtracking algorithm: rat in maze
摘要：Sept. 10, 2015 Study again the back tracking algorithm using recursive solution, rat in maze, a classical problem. Made a few of mistakes through the ... 阅读全文

posted @ 2015-09-14 04:50 juliachen 阅读(382) 评论(0) 推荐(0)

Leetcode, construct binary tree from inorder and post order traversal
摘要：Sept. 13, 2015Spent more than a few hours to work on the leetcode problem, and my favorite blogs about this problems:1.http://siddontang.gitbooks.io/l... 阅读全文

posted @ 2015-09-14 04:46 juliachen 阅读(411) 评论(0) 推荐(0)

Leetcode 99: Recovery binary search tree 总算明白了算法, 把代码写清楚, 让错误无处可藏.
摘要：想写点什么, 因为这道题花了我好几个小时, 在周日, 除了在球场上跑了二个小时, 就泡在这道题上面.read blogs:http://www.lifeincode.net/programming/leetcode-recover-binary-search-tree-java/http://www... 阅读全文

posted @ 2015-09-01 12:06 juliachen 阅读(317) 评论(0) 推荐(0)

导航