JAVA_Longest Continuous Increasing Subsequence_LeetCode 674

JAVA_Longest Continuous Increasing Subsequence_LeetCode 674 풀이 class Solution { public int findLengthOfLCIS(int[] nums) { int num = 1; int num2 = 1; for(int i = 1; i < nums.length; i++) { num2 = nums[i] > nums[i - 1] ? num2 + 1 : 1; num = Math.max(num, num2); } return nums.length == 0 ? 0 : num; } } * 출처 Longest Continuous Increasing Subsequence - LeetCode Longest Continuous Increasing Subsequence - Given an unsorted array of integers nums, return the length of the longest continuous increasing ...

원문링크 : JAVA_Longest Continuous Increasing Subsequence_LeetCode 674