class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:

        lis = [0]*len(nums)
        max_so_far = 0

        for i in range(len(nums)):
            max_prev = 0
            for j in range(i):
                if nums[i] > nums[j]:
                    max_prev = max(max_prev, lis[j])

            lis[i] = 1 + max_prev
            max_so_far = max(max_so_far, lis[i])

        return max_so_far

class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:

        lis = [1]*len(nums)
        max_so_far = 0

        for i in range(len(nums)):
            for j in range(i):
                if nums[i] > nums[j]:
                    lis[i] = max(lis[i], 1 + lis[j])

            max_so_far = max(max_so_far, lis[i])

        return max_so_far