动态规划-300. Longest Increasing Subsequence

最新推荐文章于 2019-01-07 13:23:37 发布

遇见更好的自己

最新推荐文章于 2019-01-07 13:23:37 发布

阅读量198

点赞数

分类专栏： leetcode刷题文章标签：动态规划

本文链接：https://blog.csdn.net/yc1203968305/article/details/78170751

版权

leetcode刷题专栏收录该内容

73 篇文章 0 订阅

订阅专栏

题目：

Given an unsorted array of integers, find the length of longest increasing subsequence.

For example,
Given [10, 9, 2, 5, 3, 7, 101, 18],
The longest increasing subsequence is [2, 3, 7, 101], therefore the length is 4. Note that 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.

题意解读：给定一个未排序的整数数组，寻找最长递增子串的长度

//dp[i]是以nums[i]结尾的最长上升子序列的长度
//状态转移方程：if(nums[i] > nums[j] && dp[i] < dp[j]+1) dp[i] = dp[j] + 1
class Solution {
    public int lengthOfLIS(int[] nums) {
        if(nums==null || nums.length==0) return 0;
        int[] dp = new int[nums.length];
        int maxI = Integer.MIN_VALUE;
        for(int i= 0; i < nums.length; i++){
            dp[i] = 1;//初始化dp[i]
            for(int j = 0; j < i; j++){
                if(nums[i] > nums[j] && dp[i] < dp[j]+1)
                    dp[i] = dp[j]+1;
            }
            maxI = Math.max(maxI,dp[i]);
        }
        return maxI;
        // Arrays.sort(dp);
        // return dp[nums.length-1];
    }
}