摘要：
1.Given an array of integers, find a contiguous subarray which has the largest sum.hint: Go through the array with 2 variable -- cur and count. cur i... 阅读全文
摘要：
http://pages.cs.wisc.edu/~skrentny/cs367-common/readings/Red-Black-Trees/http://en.wikipedia.org/wiki/Red–black_tree1.Every node is either red or blac... 阅读全文