Sword finger offer notes: t57 - ii Continuous positive sequence with sum s

T57 - II. And for s Continuous positive sequence of

Enter a positive integer target , Output all and as target A sequence of continuous positive integers （ Contains at least two numbers ）.

The numbers in the sequence are arranged from small to large , The different sequences are arranged in descending order according to the first number .

Example 1：

Input ：target = 9
Output ：[[2,3,4],[4,5]]
Example 2：

Input ：target = 15
Output ：[[1,2,3,4,5],[4,5,6],[7,8]]

Limit ：

1 <= target <= 10^5

solution 1

Didn't do it

solution 2

class Solution {
    public int[][] findContinuousSequence(int target) {
        int left = 1;
        int right = 2;
        List<int[]> res = new ArrayList<>();

        while (left < right) {
            int sum = (left + right) * (right - left + 1) / 2;
            if (sum == target){
                int[] arr = new int[right - left + 1];
                for (int k = left; k <= right; k++) {
                    arr[k - left] = k;
                }
                res.add(arr);
                left++;
            }
            else if (sum < target) {
                right++;
            }
            else {
                left++;
            }
        }
        return res.toArray(new int[res.size()][]);
    }
}

Execution time ：4 ms, In all  Java  Defeated in submission **56.28%** Users of

Memory consumption ：36.4 MB, In all  Java  Defeated in submission **86.99%** Users of

Time complexity ：O(target)O(target). Sliding window moves at most target/2 Time
Spatial complexity ：O(1)O(1). Exclude the necessary storage result array , Just save the left and right pointers

author ： Painter Dapeng
link ：https://leetcode-cn.com/leetbook/read/illustrate-lcof/5017gs/
source ： Power button （LeetCode）
The copyright belongs to the author . Commercial reprint please contact the author for authorization , Non-commercial reprint please indicate the source .