Leetcode 368. Largest Divisible Subset - Deribs4 - 博客园
368. Largest Divisible Subset
Total Accepted: 864 Total Submissions: 2728 Difficulty: Medium
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 Sj % Si = 0.
If there are multiple solutions, return any subset is fine.
Example 1:
nums: [1,2,3] Result: [1,2] (of course, [1,3] will also be ok)
Example 2:
nums: [1,2,4,8] Result: [1,2,4,8]
思路：
定义T[n]为最大值为nums[n]的满足题意的子集元素个数。
显然如果存在i（i<n），有nums[n]%nums[i]，T[n]=max{T[i]+1}；否则，T[n]=1。
Read full article from Leetcode 368. Largest Divisible Subset - Deribs4 - 博客园
No comments:
Post a Comment