Longest Increasing Subsequence
发布时间:2020-12-14 03:22:06 所属栏目:大数据 来源:网络整理
导读:Given an unsorted array of integers,find the length of longest increasing subsequence. Example: Input: Output: 4 Explanation: The longest increasing subsequence is,therefore the length is . [10,9,2,5,3,7,101,18][2,101]4 Note:? There may be
Given an unsorted array of integers,find the length of longest increasing subsequence. Example: Input: Output: 4 Explanation: The longest increasing subsequence is,therefore the length is . [10,9,2,5,3,7,101,18][2,101]4 Note:?
Follow up:?Could you improve it to O(n?log?n) time complexity? Solution: Using dynamic programming and binary search,a[i] for the min last value of?increasing subsequence of length i. class Solution { public int lengthOfLIS(int[] nums) { int[] a = new int[nums.length]; int max_len = 0; for (int i = 0; i < nums.length; i++) { int index = Arrays.binarySearch(a,0,max_len,nums[i]); if (index < 0) { int p = -index-1; a[p] = nums[i]; if (p == max_len) max_len++; } } return max_len; } } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |