2015年11月17日
LeetCode OJ：Longest Increasing Subsequence（最长递增序列）
摘要： 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 incre... 阅读全文
posted @ 2015-11-17 20:51 eversliver 阅读(258) 评论(0) 推荐(0)
LeetCode OJ：Ugly Number II（丑数II）
摘要： Write a program to find then-th ugly number.Ugly numbers are positive numbers whose prime factors only include2, 3, 5. For example,1, 2, 3, 4, 5, 6, 8... 阅读全文
posted @ 2015-11-17 19:40 eversliver 阅读(223) 评论(0) 推荐(0)