-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
368.py
72 lines (66 loc) · 2.35 KB
/
368.py
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
__________________________________________________________________________________________________
sample 104 ms submission
import collections
class Solution:
def largestDivisibleSubset(self, nums: List[int]) -> List[int]:
if nums == []:
return []
counter = collections.Counter(nums)
nums = sorted(counter.keys())
n = len(nums)
max_num, max_val = nums[0], counter[nums[0]]
res = dict()
res[nums[0]] = -1, counter[nums[0]]
for i in range(1, n):
x = nums[i]
sqrt_ = min(int(math.sqrt(x) + 0.5) + 1, x + 1)
pre, best = -1, 0
for j in range(1, sqrt_):
if x % j == 0:
tmp = res.get(j, (-1, -1))[1]
if tmp > best:
pre = j
best = tmp
u = x // j
tmp = res.get(u, (-1, -1))[1]
if tmp > best:
pre = u
best = tmp
res[x] = pre, best + counter[x]
if res[x][1] > max_val:
max_val = res[x][1]
max_num = x
ans = []
while max_num != -1:
for _ in range(counter[max_num]):
ans.append(max_num)
max_num = res[max_num][0]
return list(reversed(ans))
__________________________________________________________________________________________________
sample 13072 kb submission
class Solution:
def largestDivisibleSubset(self, nums: List[int]) -> List[int]:
n = len(nums)
if n == 0:
return []
dp = [[1, i] for i in range(n)]
nums.sort()
for i in range(1, n):
for j in range(i):
if nums[i] % nums[j] == 0:
if 1 + dp[j][0] > dp[i][0]:
dp[i][0] = 1 + dp[j][0]
dp[i][1] = j
mi = 0
mx = 0
for i in range(n):
if dp[i][0] > mx:
mx = dp[i][0]
mi = i
ans = []
i = mi
while dp[i][1] < i:
ans.append(nums[i])
i = dp[i][1]
return [nums[i]] + ans
__________________________________________________________________________________________________