求1维数组最大子段和,适合初学者，算法设计与基础，写的通俗易懂，且正确-Seeking the largest sub-segment of a one-dimensional array, suitable for beginners, algorithm design and basic written in easy to understand, and correct