algoritm (1) 썸네일형 리스트형 [Leetcode] 300. Longest Increasing Subsequence https://leetcode.com/problems/longest-increasing-subsequence/ 불러오는 중입니다... 1. Problem Given an unsorted array of integers, find the length of longest increasing subsequence. 2. Algorithm I used dp solution with time complexity O(n^2). Step 1. Iterate index i 0 to length of array. -> O(n) Step 2. With index j find the longest length before d[i] iteratively, where nums[i] > nums[j]. -> O(n) Step 3.. 이전 1 다음
