Longest increasing subsequence, with basic tests

longestIncreasingSubsequence.js

/**
 * @param {number[]} nums
 * @return {number}
 */
var lengthOfLIS = function(nums) {
    if (!nums || !nums.length) { return 0 }
    var increasingSubsequences = [];
    var maxSubsequence = {
        length: 0,
        index: 0
    };
    for (var i = 0; i < nums.length; i++) {
        let element = nums[i];
        for (var l = 0; l < increasingSubsequences.length; l++) {
            var subsequence = increasingSubsequences[l];
            if (element > subsequence[subsequence.length - 1]) {
                subsequence.push(element);
                if (subsequence.length > maxSubsequence.length) {
                    maxSubsequence.index = l;
                    maxSubsequence.length = subsequence.length;
                }
            }
        }
        increasingSubsequences.push([element]);
    }
    return maxSubsequence.length;
};


var testCases = [
    {
        input: [10,9,2,5,3,7,101,18],
        output: 4
    },
    {
        input: [1,2,3,5,3,7,8],
        output: 6
    },
    {
        input: [3,2,1,0],
        output: 0
    },
    {
        input: [3,2,0,1],
        output: 2
    },
    {
        input: [],
        output: 0
    }
]

testCases.map(function(test) {
    var result = lengthOfLIS(test.input);
    console.log(`Test result: ${result}, expected: ${test.output}`)
})