Given an unsorted array of integers, find the length of the longest strictly increasing subsequence.
nums = [10,9,2,5,3,7,101,18]
4
nums = [0,1,0,3,2,3]