摘要：
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-12-17 06:55
lettuan
阅读(167)
评论(0)
推荐(0)
摘要：
Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t is po 阅读全文
posted @ 2016-12-17 06:17
lettuan
阅读(189)
评论(0)
推荐(0)
摘要：
Given a positive integer n and you can do operations as follow: What is the minimum number of replacements needed for n to become 1? Example 1: Exampl 阅读全文
posted @ 2016-12-17 05:24
lettuan
阅读(240)
评论(0)
推荐(0)
浙公网安备 33010602011771号