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

class Solution {

    public static  int[][] findContinuousSequence(int target) {
        List<int[]> list = new ArrayList<>();
        int sum = 0, limit = target - 1;
        for (int i = 1; i < limit; i++) {
            for (int j = i; ; j++) {
                sum += j;
                if (sum > target){
                    sum = 0;
                    break;
                } else  if (sum == target) {
                    int[] arr = new int[j - i + 1];
                    for (int k = i; k <= j; k++) {
                        arr[k - i] = k;
                    }
                    list.add(arr);
                }
            }
        }
        return list.toArray(new int[list.size()][]);
    }
}