-
Notifications
You must be signed in to change notification settings - Fork 0
/
largest divisible subset
47 lines (36 loc) · 1.15 KB
/
largest divisible subset
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
class Solution:
def largestDivisibleSubset(self, nums: List[int]) -> List[int]:
nums.sort()
n=len(nums)
dp=[1]*(n)
total=1
for i in range(1,n):
maxi=0
for j in range(i):
if nums[i]%nums[j]==0:
maxi=max(maxi,dp[j])
dp[i]+=maxi
total=max(total,dp[i])
for i in range(n-1,-1,-1):
if dp[i]==total:
ind=i
break
out=[nums[ind]]
last=ind
for i in range(ind-1,-1,-1):
if dp[i]+1==total and out[-1]%nums[i]==0:
out.append(nums[i])
ind=i
total=dp[i]
return out
Given a set of distinct positive integers nums, return the largest subset answer such that every pair (answer[i], answer[j]) of elements in this subset satisfies:
answer[i] % answer[j] == 0, or
answer[j] % answer[i] == 0
If there are multiple solutions, return any of them.
Example 1:
Input: nums = [1,2,3]
Output: [1,2]
Explanation: [1,3] is also accepted.
Example 2:
Input: nums = [1,2,4,8]
Output: [1,2,4,8]