[LintCode]Eat The Beans

[LintCode]Digital Coverage

[LintCode]Gas Station II

[LintCode]The Longest Scene

[LinttCode]The Barycentre Of The Trees

[LintCode]Longest Common Subsequence

[LintCode]Longest Common Substring

[LintCode]Maximum Subarray III

[LintCode]Maximum Subarray Difference

[LintCode]Minimum Subarray

[LintCode]Maximum Subarray II

[LintCode]Lowest Common Ancestor

[LintCode]Serialization and Deserialization Of Binary Tree

[LintCode]Search Range In Binary Search Tree

首先是brute-force的方法， inorder看是不是在range里，在的话就加入。时间复杂度是O(N)。显然面试官不可能希望这个方法。

[LintCode]Remove Node in Binary Search Tree

删除的时候三种情况：

• 没有子节点
• 有一个子节点
• 有两个子节点

[LintCode]Insert Node in Binary Search Tree

很简单题，每个node决定是往左还是往右还是就是这个节点。类似二分的做法。