求数组最大子数组之和

#用来获得最大子数组之和定义成方法也方便后面的单元测试
def max(a):
    out=temp=0
    for i in range(0,len(a)):
        temp+=a[i]
        if temp>out:
            out=temp
        if temp<0:
            temp=0
    return out
if name == ‘main‘:

i=1

#循环这个程序，方便封包之后更好的使用

while i == 1:

print(‘1.计算最大子数组之和‘)

print(‘2.退出‘)

print(‘输入你的选择：‘)

s=int(input())

if s == 1:

a = map(int,input(‘输入用空格隔开:‘).split())

print(‘最大的子数组之和为‘,end=‘‘)

print(max(list(a)))

elif s == 2:

i=-1

else :

print(‘请重新输入选择：‘)

s=int(input())

#使用cmd命令符进行封包
#使用封包提前pip install pyinstaller -i https://pypi.tuna.tsinghua.edu.cn/simple
pyinstaller -F py文件路径 --distpath=exe文件生成路径

class max_out(object):
    def __init__(self,a):
        self.a=a
    def max(a):
        out=temp=0
        for i in range(0,len(a)):
            temp+=a[i]
            if temp>out:
                out=temp
            if temp<0:
                temp=0
        return out

import unittest  
from demo import *
class TestDemo(unittest.TestCase):

def test_out_1(self):

a = [1,-2,3,-4,5]

self.assertEqual(max(a),5)

def test_out_2(self):

a = [-32,-10,33,-23,32,-12,41,-12,1,3,5,-98,70,-21,10,-9,61]

self.assertNotEqual(max(a),71)
if name == ‘main‘:

unittest.main()