剑指Offer 57- 和为s的连续整数序列

class Solution:
    def findContinuousSequence(self, target: int) -> List[List[int]]:
        #双指针
        i, j, s, res = 1, 2, 3, []
        while i < j:
            if s == target:
                res.append(list(range(i, j+1)))
            if s >= target:
                s -= i
                i += 1
            else:
                j += 1
                s += j
        return res
        
        '''
        复杂的递归
        res = []
        def solution(target, n):
            tmp.append(n)
            if target > n:
                return solution(target-n, n+1)
            elif target == n:
                return tmp
            else:
                return False
        for i in range(1, target // 2 + 1):
            tmp = []
            tmp2 = solution(target, i)
            if tmp2:
                res.append(tmp2)
        return res
        '''