题目描述:
输入一个正整数 target ,输出所有和为 target 的连续正整数序列(至少含有两个数)。
序列内的数字由小到大排列,不同序列按照首个数字从小到大排列。
示例1:
输入:target = 9
输出:[[2,3,4],[4,5]]
示例 2:
输入:target = 15
输出:[[1,2,3,4,5],[4,5,6],[7,8]]
思路1:
暴力遍历枚举
class Solution:
def findContinuousSequence(self, target: int) -> List[List[int]]:
res = []
for i in range(1, target//2 + 2):
sum, path = 0, []
for j in range(i, target//2+2):
sum += j
path += [j]
if sum == target:
res.append(path)
break
elif sum > target:
break
return res
但是这样时间复杂度会很高。
**思路2:**双指针
class Solution:
def findContinuousSequence(self, target: int) -> List[List[int]]:
i, j, sum, res = 1, 2, 3, []
while i < j:
if sum == target:
res.append([k for k in range(i, j+1)])
sum = sum - i
i = i + 1
elif sum > target:
sum = sum - i
i = i + 1
elif sum < target:
j = j + 1
sum = sum + j
return res