最大子序和完整python代码

from typing import List
class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        temp=nums[0]
        max_=temp
        for i in range(1,len(nums)):
            if temp>0:
                temp+=nums[i]
                max_=max(max_,temp)

            else:
                temp=nums[i]
                max_=max(max_,temp)
        return max_
if __name__ == '__main__':
    nums=[]
    for _ in range(10):
        n=float(input("请输入"))
        if n!=0: #等于零表示输入结束
            nums.append(n)
        else:
            break
    c=Solution()
    print(c.maxSubArray(nums))