题解 | 游游的最长稳定子数组

import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
int len = 0;
        ArrayList<Integer> list = new ArrayList<>();
        Scanner sc = new Scanner(System.in);
        len = sc.nextInt();
        for (int i = 0; i < len; i++) {
            list.add(sc.nextInt());
        }
        int maxlen = 0;
        int[] arr = new int[list.size() - 1];
        for (int i = 1; i < list.size(); i++) {
            if (Math.abs(list.get(i) - list.get(i - 1)) <= 1) {
                arr[i - 1]++;
            }
            
        }

        StringBuilder ss = new StringBuilder();
        for (int i = 0; i < arr.length; i++) {
            ss.append(arr[i]);
        }

        String[] split = ss.toString().split("0");
           for (int i = 0; i < split.length; i++) {
         if (split[i].length() >= maxlen) {
             maxlen = split[i].length();
         }
     }
     System.out.println(maxlen+1);
    }
}