Longest Increasing Subsequence | Leetcode 300 solution

Given an integer array nums, return the length of the longest strictly increasing 

subsequence

.

 

Example 1:

Input: nums = [10,9,2,5,3,7,101,18]
Output: 4
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.

Example 2:

Input: nums = [0,1,0,3,2,3]
Output: 4

Example 3:

Input: nums = [7,7,7,7,7,7,7]
Output: 1

 

Constraints:

• 1 <= nums.length <= 2500
• -104 <= nums[i] <= 104

solution :

class Solution { public:       int lengthOfLIS(vector<int>& nums) {         int cnt = INT_MIN;         int size = nums.size();         vector<int>dp(size+1, 1);         for(int i =0 ; i < size ; i++)         {             for(int j =0 ; j < i ; j++)             {                      if(nums[j] < nums[i])                   dp[i] = max(dp[i], dp[j] +1);             }             cnt = max(cnt , dp[i]);         }         return cnt;     } };