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 more than one LIS combination,it is only necessary for you to return the length.
- Your algorithm should run in O(n2) complexity.
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; } }
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。