Commit86cfa74

committed

300-longest-increasing-subsequence.md Perfected Python code.

1 parentf4ff34a commit86cfa74Copy full SHA for 86cfa74

File tree

-6

lines changed

-6

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -72,10 +72,10 @@ class Solution:`
`72`	`72`	`deflengthOfLIS(self,nums: List[int]) ->int:`
`73`	`73`	`dp= [1]*len(nums)`
`74`	`74`
`75`		`-for i, numinenumerate(nums):`
	`75`	`+for iinrange(1,len(dp)):`
`76`	`76`	`for jinrange(i-1,-1,-1):`
`77`		`-ifnum> nums[j]:`
`78`		`- dp[i]=max(dp[i], dp[j]+1)`
	`77`	`+ifnums[i]> nums[j]and dp[j]+1> dp[i]:`
	`78`	`+ dp[i]= dp[j]+1`
`79`	`79`
`80`	`80`	`returnmax(dp)`
`81`	`81`	```

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -72,10 +72,10 @@ class Solution:`
`72`	`72`	`deflengthOfLIS(self,nums: List[int]) ->int:`
`73`	`73`	`dp= [1]*len(nums)`
`74`	`74`
`75`		`-for i, numinenumerate(nums):`
	`75`	`+for iinrange(1,len(dp)):`
`76`	`76`	`for jinrange(i-1,-1,-1):`
`77`		`-ifnum> nums[j]:`
`78`		`- dp[i]=max(dp[i], dp[j]+1)`
	`77`	`+ifnums[i]> nums[j]and dp[j]+1> dp[i]:`
	`78`	`+ dp[i]= dp[j]+1`
`79`	`79`
`80`	`80`	`returnmax(dp)`
`81`	`81`	```

Comments

(0)