python实现----查找数组中连续元素的和等于给定数的子数组

def findSubArraySum(array,target):
    for i in range(len(array)):
        temp=0
        for j in range(i,len(array)):
            temp+=array[j]
            if temp<target:
                continue
            elif temp==target:
                for k in range(i,j+1):
                    print(array[k])
            else:
                break

if __name__=="__main__":
    array=[1,2,4,7,8,9]
    target=7
    findSubArraySum(array,target)