Given an unsorted array of integers, return an array with the longest increasing subsequence.
Input: [11, 41, 52, 12, 18, 21, 19, 43, 17, 53]
Output: [17, 18, 19]
类似 https://leetcode.com/problems/longest-increasing-subsequence/ 但是 The question says return the subsequence array, not the length of it