397 - 连续上升子序列

最新推荐文章于 2022-05-09 22:32:28 发布

Missbubu

最新推荐文章于 2022-05-09 22:32:28 发布

阅读量257

点赞数

分类专栏： lintcode

本文链接：https://blog.csdn.net/Missbubu/article/details/70173130

版权

lintcode 专栏收录该内容

218 篇文章 0 订阅

订阅专栏

4.14

同号的问题可以用乘法解决

public class Solution {
    /**
     * @param A an array of Integer
     * @return  an integer
     */
  	public static int longestIncreasingContinuousSubsequence(int[] A) {
        if(A.length <=1){// Write your code here
        	return A.length;
        }
        int max = 0;
        int count = 1;
        for(int i = 1;i<A.length -1;i++){
        	if(A[i] != A[i-1]){
                count++;
        	}
        	while(i<A.length-1 && (A[i] - A[i+1])*(A[i-1]-A[i])>0){
        		i++;
        		count ++;
        	}
        	if(count > max){
        		max = count;
        	}
        	count = 1;
        	
        }
 return max;
    }
}

后来用动态规划的思想做了一下，用时减少一半

public class Solution {
    /**
     * @param A an array of Integer
     * @return  an integer
     */
  	public static int longestIncreasingContinuousSubsequence(int[] A) {
        if(A.length <=1){// Write your code here
        	return A.length;
        }
        int max = 0;
        int count = 1;
        for(int i = 1;i<A.length -1;i++){
        	if(A[i] != A[i-1]){
                count++;
        	}
        	while(i<A.length-1 && (A[i] - A[i+1])*(A[i-1]-A[i])>0){
        		i++;
        		count ++;
        	}
        	if(count > max){
        		max = count;
        	}
        	count = 1;
        	
        }
        return max;
    }
}