zoukankan      html  css  js  c++  java
  • leetcode : Longest Increasing Subsequence

    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.

    Follow up: Could you improve it to O(n log n) time complexity?

     

    tag: dynamic programming. 动态规划。

     

    f[i] = max{f[j] + 1}, j必须满足 j < i && nums[j] <= nums[i] 

     

    注意: sequence 与 substring的区别

     

    public class Solution {
        public int lengthOfLIS(int[] nums) {
            if(nums == null || nums.length == 0) {
                return 0;
            }
            int length = nums.length;
            int[] dp = new int[length];
            for(int i = 0; i < length; i++) {
                dp[i] = 1;
            }
            
            int max = dp[0];
            for(int i = 1; i < length; i++)
              for(int j = 0; j < i; j++) {
                  if(nums[i] > nums[j]) {
                      dp[i] = Math.max(dp[j] + 1, dp[i]);
                  }
                  max = Math.max(max,dp[i]);
              }
           return max;
        }
    }
    

      

  • 相关阅读:
    【学术篇】SDOI2017 数字表格
    【学术篇】分析矿洞 杜教筛
    【学术篇】bzoj3262 陌上花开. cdq分治入门
    ubuntu搭建git服务器
    windows中操作文件和目录的函数
    php的单例模式
    linux挂载新硬盘
    改造vim
    关于在mfc中cstring转为float和ini
    windows自带的线程池
  • 原文地址:https://www.cnblogs.com/superzhaochao/p/6422262.html
Copyright © 2011-2022 走看看