code.ashish.me

Atom feed

Recently added: 02 Count Of Subset Sum, 416 Partition Equal Subset Sum, 01 Subset Sum, 518 Coin Change 2, 983 Minimum Cost For Tickets

300 Longest Increasing Subsequence

/**
 * 
 * Ashish Patel
 * e: ashishsushilPatel@gmail.com
 * w: https://ashish.me
 *
 */

/* 
* Given an unsorted array of integers, find the length of longest increasing subsequence.
* 
* Example:
* 
* Input: [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. 
* Note:
* 
* There may be more than one LIS combination, it is only necessary for you to return the length.
* Your algorithm should run in O(n2) complexity.
*/


function longestIncreasingSubsequence(nums) {
  let dp = new Array(nums.length).fill(1)
  let max = 0
  for (let i = 1; i < nums.length; i++){ 
    for (let j = 0; j < i; j++) {
      if(nums[j] < nums[i]){
        dp[i] = Math.max(dp[j] + 1, dp[i])
      }
    } 
    max = Math.max(max, dp[i])   
  }
  return max
}

test('longest Increasing Subsequence', () => {
  expect(longestIncreasingSubsequence([1,4,0,7])).toEqual(3)
  expect(longestIncreasingSubsequence([10,9,2,5,3,7,101,18])).toEqual(4)
});

Created 2020-03-26T09:29:40+00:00 · Edit