2017年5月26日

[LintCode] Largest Divisible Subset
摘要： Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or  阅读全文
posted @ 2017-05-26 12:31 codingEskimo 阅读(145) 评论(0) 推荐(0) 编辑
[LintCode] Longest Increasing Subsequence
摘要： Given a sequence of integers, find the longest increasing subsequence (LIS). You code should return the length of the LIS. Given a sequence of integer 阅读全文
posted @ 2017-05-26 11:05 codingEskimo 阅读(98) 评论(0) 推荐(0) 编辑

导航