LeetCode--674--easy--LongestContinuousIncreasingSubsequence

package com.app.main.LeetCode.dynamic;

/**
 * 674
 *
 * easy
 *
 * https://leetcode.com/problems/longest-continuous-increasing-subsequence/
 *
 * Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).
 *
 * Example 1:
 * Input: [1,3,5,4,7]
 * Output: 3
 * Explanation: 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: 1
 * Explanation: The longest continuous increasing subsequence is [2], its length is 1.
 * Note: Length of the array will not exceed 10,000.
 *[1,3,5,4,2,3,4,5]
 *
 * Created with IDEA
 * author:Dingsheng Huang
 * Date:2020/1/2
 * Time:下午3:53
 */
public class LongestContinuousIncreasingSubsequence {

    public int findLengthOfLCIS(int[] nums) {
        if (nums.length == 0) {
            return 0;
        }
        int result = 1;
        int max = 1;
        int[] dp = new int[nums.length];
        dp[0] = 1;
        for (int i = 1; i < nums.length; i++) {
            dp[i] = nums[i] > nums[i - 1] ? (dp[i - 1] + 1) : 1;
            result = Math.max(result, dp[i]);
        }
        return result;
    }
}