LeetCode 666. 没有什么是抛异常解决不了的~
原题链接
简单
作者:
我不叫喂
,
2023-11-16 21:51:11
,
所有人可见
,
阅读 44
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.Stack;
class Solution {
public static void main(String[] args) {
System.out.println(longestAlternatingSubarray(new int[]{3,2,5,4}, 5));
}
public static int longestAlternatingSubarray(int[] nums, int threshold) {
List<Stack<Integer>>list=new ArrayList<>();
for(int i=0;i< nums.length;i++) {
Stack<Integer>stack=new Stack<>();
if(nums[i]%2==0&&nums[i]<=threshold){
stack.push(nums[i]);
try {
for(int j=i+1;j< nums.length;j++){
if(nums[j]%2!=nums[j-1]%2&&nums[j]<=threshold){
stack.push(nums[j]);
}else {
break;
}
}
}catch (Exception e){
continue;
}
}
list.add(stack);
}
int maxv=0;
for(Stack s:list){
maxv=s.size()>maxv?s.size():maxv;
}
return maxv;
}
}