Longest Continuous Increasing Subsequence

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

Example 1:

Input: [1,3,5,4,7]Output: 3Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3. Even though [1,3,5,7] is also an increasing subsequence, it's not a continuous one where 5 and 7 are separated by 4. 

Example 2:

Input: [2,2,2,2,2]Output: 1Explanation: The longest continuous increasing subsequence is [2], its length is 1. 

Note: Length of the array will not exceed 10,000.

思路：

1.首先知道题目是要求一个数组里最长的递增子序列的长度（严格大于）

2.应该能明显的看出这是一个动态规划题。局部最优的递推式为

local = nums[i] > nums[i-1]?local+1:1;

从局部最优中挑选出最大的就是所求的结果。

public class LongestContinuousIncreasingSubsequence {    public int findLengthOfLCIS(int[] nums) {    if(nums == null || nums.length == 0) return 0;        int global = 1;        int local = 1;        for(int i=1; i<nums.length; i++) {        local = nums[i] > nums[i-1]?local+1:1;        global = Math.max(local, global);        }        return global;    }}