importjava.util.ArrayList;importjava.util.List;//leetcode submit region begin(Prohibit modification and deletion)classSolution{publicint[][]findContinuousSequence(int target){int fast =2;int slow =1;int end = target/2+1;int sum =slow;List<int[]> list =newArrayList<>();while(slow<end){
sum=sum+fast;if(sum<target){
fast++;continue;}if(sum==target){int[] arr =newint[fast-slow+1];for(int i=slow;i<=fast;i++){
arr[i-slow]=i;}
list.add(arr);}
slow++;
fast=slow+1;
sum=slow;}int[][] res =newint[list.size()][];return list.toArray(res);}}