vlsi1217 / leetlint

Fight for your dream: first step, finish 9chap, Algs4/Stanford, and Leet/Lintcode

README

Leetcode/Lintcode

20151110

• Finish Senior Dynamic Programming

20151108

• Finished two pointers, very elegant algorithm, the key point is the prove of correctness of no return of j. And this leads from O(n^2) to O(n)!