We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent da40241 commit 767262eCopy full SHA for 767262e
1 file changed
Python/largest-divisible-subset.py
@@ -37,8 +37,8 @@ def largestDivisibleSubset(self, nums):
37
if dp[i] < dp[j] + 1:
38
dp[i] = dp[j] + 1
39
prev[i] = j
40
- if dp[largest_idx] < dp[i]:
41
- largest_idx = i
+ if dp[largest_idx] < dp[i]:
+ largest_idx = i
42
result = []
43
i = largest_idx
44
while i != -1:
0 commit comments