300. Longest Increasing Subsequence
发布时间:2020-12-14 04:40:31 所属栏目:大数据 来源:网络整理
导读: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? class Solution { public int lengthOfLIS(int[] nums) { int l = nums.length; if(l == 0) return 0; int[] f = new int[l]; int res = 1; Arrays.fill(f,1); for(int j = 1; j < l; j++){ for(int i = 0; i < j; i++){ if(nums[j] > nums[i]){ f[j] = Math.max(f[j],f[i] + 1); } } res = Math.max(res,f[j]); } return res; } } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |