99클럽 코테 스터디 29/99일차 TIL #이분탐색(미들러)

https://leetcode.com/problems/longest-increasing-subsequence/description/

 

class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:
    # def lengthOfLIS(nums):
        if not nums:
            return 0
        
        dp = [1] * len(nums)
        
        for j in range(1, len(nums)):
            for i in range(j):
                if nums[j] > nums[i]:
                    dp[j] = max(dp[j], dp[i] + 1)
        
        return max(dp)