剑指 Offer 57 - II. 和为s的连续正数序列

public class FindContinuousSequence {
    public int[][] findContinuousSequence(int target) {
        /**
         * @Method: findContinuousSequence
         * @Author: haifwu
         * @Version:  1.0
         * @Date: 21/05/2021 10:25
         * @param target
         * @Return: java.util.List<java.util.List<java.lang.Integer>>
         * @Description: 枚举 + 暴力
         *
         */
        List<int[]> list = new ArrayList<>();

        int n = target / 2 + 1;  // 下取整
        for(int i = 1; i < n; i ++) {
            int sum = i, t = i + 1;
            while(sum < target && t <= n) {
                sum += t;
                if (sum  == target) {
                    int[] temp = new int[t - i + 1];
                    for(int k = i; k <= t; ++k) {
                        temp[k - i] = k;
                    }
                    list.add(temp);
                    break;
                }
                t++;
            }
        }
        return list.toArray(new int[list.size()][]);
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int target = scanner.nextInt();
        int[][] list = new FindContinuousSequence().findContinuousSequence(target);
        int n = list.length;
        for (int i = 0; i < n; i++) {
            int m = list[i].length;
            for (int j = 0; j < m; j++) {
                System.out.print(list[i][j] + "  ");
            }
            System.out.println();
        }
    }
}