We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 8b78bf8 + 24b23e5 commit fdc91b9Copy full SHA for fdc91b9
longest_increasing_subsequence.py
@@ -0,0 +1,19 @@
1
+def lengthOfLongestInceasingSubsequence(nums):
2
+ nums_len = len(nums)
3
+ dp = [1] * nums_len
4
+
5
+ for i in range(1, nums_len):
6
+ for j in range(0, i):
7
+ if nums[j] < nums[i]:
8
+ dp[i] = max(dp[i], dp[j] + 1)
9
+ return max(dp)
10
11
12
+if __name__ == '__main__':
13
+ nums = []
14
+ n = int(input())
15
+ for _ in range(0, n):
16
+ ele = int(input())
17
+ nums.append(ele)
18
+ print(nums)
19
+ print(lengthOfLongestInceasingSubsequence(nums))
0 commit comments