[LeetCode] 674. Longest Continuous Increasing Subsequence - Java

• 문제 링크

Longest Continuous Increasing Subsequence - LeetCode

 

• 풀이 코드

public class Solution {

    public int findLengthOfLCIS(int[] nums) {
        int max = 1, cur = 1;
        for (int i = 1; i < nums.length; i++) {
            if (nums[i - 1] < nums[i]) max = Math.max(max, ++cur);
            else cur = 1;
        }

        return max;
    }

}