/** * retrun the longest increasing subsequence * @param arr int整型一维数组 the array * @return int整型一维数组 */ function LIS( arr ) { // write code here // 贪心+二分 // 自顶向下编程 function search(arr, target) { let pos = -1; let left = 0, right = arr.length-1; let mid; ...