import math classSolution: deffindContinuousSequence(self, target: int): n = int(math.sqrt(2 * target) + 1) if n < 2: return [] sum_list = [] a = 0 for i in range(2, n+1): a = ((2 * target) / i + 1 - i) / 2 if a andnot a % 1: a = int(a) s_ = [] for j in range(0, i): s_.append(a + j) sum_list.append(s_) return sorted(sum_list) # 60 ms 13.7 MB