2016年6月28日
[LeetCode] 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 @ 2016-06-28 22:23 Grandyang 阅读(17907) 评论(7) 推荐(0)
Fork me on GitHub