2016年12月3日
Leetcode 416. Partition Equal Subset Sum
摘要： Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both 阅读全文
posted @ 2016-12-03 05:13 lettuan 阅读(138) 评论(0) 推荐(0)
Leetcode 368. 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-12-03 02:36 lettuan 阅读(178) 评论(0) 推荐(0)