11 2015 档案

[LeetCode] Range Sum Query - Immutable & Range Sum Query 2D - Immutable
摘要：Range Sum Query - ImmutableGiven an integer arraynums, find the sum of the elements between indicesiandj(i≤j), inclusive.Example:Given nums = [-2, 0, ... 阅读全文

posted @ 2015-11-16 18:59 Eason Liu 阅读(2291) 评论(0) 推荐(0)

[LeetCode] Longest Increasing Subsequence
摘要：Longest Increasing SubsequenceGiven an unsorted array of integers, find the length of longest increasing subsequence.For example,Given[10, 9, 2, 5, 3,... 阅读全文

posted @ 2015-11-04 13:30 Eason Liu 阅读(363) 评论(0) 推荐(0)