🧠 LeetCode 算法

分类


示例:最长递增子序列

思路

```python def lengthOfLIS(nums): dp = [1] * len(nums) for i in range(len(nums)): for j in range(i): if nums[j] < nums[i]: dp[i] = max(dp[i], dp[j] + 1) return max(dp)