滑动窗口-求数组的所有连续子数组【学习算法】

import java.util.ArrayList;
import java.util.Scanner;
/*
3
1 2 3
 */
public class Main2 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = scanner.nextInt();
        }
        ArrayList<ArrayList<Integer>> lists = subArr(a);
        System.out.println(lists);
    }
    public static ArrayList<ArrayList<Integer>> subArr(int[] nums) {
        ArrayList<ArrayList<Integer>> lists=new ArrayList<>();
        //滑动窗口的大小
        for (int k = 1; k <= nums.length; k++) {
            //左边界
            for (int i = 0; i < nums.length; i++) {
                if (i+k > nums.length){
                    continue;
                }
                ArrayList<Integer> list=new ArrayList<>();
                //窗口
                for (int j = i; j < i+k; j++) {
                    list.add(nums[j]);
                }
                lists.add(list);
            }
        }
        return lists;
    }
}