摘要: Given an unsorted array of integers, find the length of longest increasing subsequence. For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest inc 阅读全文
posted @ 2016-10-08 14:58 wxquare 阅读(130) 评论(0) 推荐(0) 编辑
摘要: Description: Count the number of prime numbers less than a non-negative number, n. 阅读全文
posted @ 2016-10-08 11:19 wxquare 阅读(150) 评论(0) 推荐(0) 编辑