Commit d3a07fa

authored

Update 0300.最长上升子序列.md

1 parent 2261538 commit d3a07faCopy full SHA for d3a07fa

File tree

+25

-1

lines changed

+25

-1

lines changed

Lines changed: 25 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -141,7 +141,7 @@ class Solution {`
`141`	`141`	`}`
`142`	`142`	`}`
`143`	`143`	```
`144`		`-`
	`144`	`+DP`
`145`	`145`	`Python:`
`146`	`146`	```python
`147`	`147`	`class Solution:`
`@@ -157,7 +157,31 @@ class Solution:`
`157`	`157`	`result = max(result, dp[i]) #取长的子序列`
`158`	`158`	`return result`
`159`	`159`	```
	`160`	`+贪心`
	`161`	+```python
	`162`	`+class Solution:`
	`163`	`+ def lengthOfLIS(self, nums: List[int]) -> int:`
	`164`	`+ if len(nums) <= 1:`
	`165`	`+ return len(nums)`
	`166`	`+`
	`167`	`+ tails = [nums[0]] # 存储递增子序列的尾部元素`
	`168`	`+ for num in nums[1:]:`
	`169`	`+ if num > tails[-1]:`
	`170`	`+ tails.append(num) # 如果当前元素大于递增子序列的最后一个元素,直接加入到子序列末尾`
	`171`	`+ else:`
	`172`	`+ # 使用二分查找找到当前元素在递增子序列中的位置,并替换对应位置的元素`
	`173`	`+ left, right = 0, len(tails) - 1`
	`174`	`+ while left < right:`
	`175`	`+ mid = (left + right) // 2`
	`176`	`+ if tails[mid] < num:`
	`177`	`+ left = mid + 1`
	`178`	`+ else:`
	`179`	`+ right = mid`
	`180`	`+ tails[left] = num`
	`181`	`+`
	`182`	`+ return len(tails) # 返回递增子序列的长度`
`160`	`183`
	`184`	+```
`161`	`185`	`Go:`
`162`	`186`	```go
`163`	`187`	`// 动态规划求解`

Comments

(0)