We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent a459aae commit ba12a75Copy full SHA for ba12a75
673-Number-of-Longest-Increasing-Subsequence.py
@@ -32,7 +32,7 @@ def dfs(i):
32
dp = {} # key = index, value = [length of LIS, count]
33
lenLIS, res = 0, 0 # length of LIS, count of LIS
34
35
- # i = start of subseq, j = end of subseq
+ # i = start of subseq
36
for i in range(len(nums) - 1, -1, -1):
37
maxLen, maxCnt = 1, 1 # len, cnt of LIS start from i
38
0 commit comments