Longest Continuous Increasing Subsequence LeetCode solution in Java

1
class Solution {
2
  public int findLengthOfLCIS(int[] nums) {
3
    int count = 1;
4
    int maxCount = 1;
5
    for (int i = 1; i < nums.length; i++) {
6
      if (nums[i] > nums[i - 1]) {
7
        count++;
8
      } else {
9
        maxCount = Math.max(count, maxCount);
10
        count = 1;
11
      }
12
    }
13
    maxCount = Math.max(count, maxCount);
14
    return maxCount;
15
  }
16
}