自然数序列，找出任意连续之和等于n的所有子序列

lst = [0,2,4,5,3,1,8,6,4,7,9,3,2]total_sum = 9def sum_seq(lst):    seq = []    ct = 0    for x in lst:        seq.append(x)        ct += x        if ct == total_sum:            print seq            continue        if ct < total_sum:            continue        if ct > total_sum:            seq_len = len(seq)            for i in range(seq_len):                tr = seq.pop(0)                ct -= tr                if ct < total_sum:                    break                if ct == total_sum:                    print seqsum_seq(lst)