本文的内容在于利用动态规划的思路解决最大子段和问题,在本题中,所谓动态规划的思路即是从第一个数开始,两数相加,若和为负数,则此和在与下一个数相加时,必会导致下一个数的减小,那么为了求最大子段和,便需要将这个负数和舍掉,更新为第三个数,从第三个数开始重新算和。以下即为代码,用的是python语言。
#首先从键盘上输入列表,输入ok后循环结束,得到列表
numbers = []
while True:
number = input("Enter a number (or 'ok' is end):")
if number == 'ok':
break
else:
numbers.append(int(number))
print(numbers)
#开始计算最大子段和
i = 0
first_sum = numbers[0]
second_sum = numbers[0]
while i < len(numbers) - 2:
i = i + 1
if first_sum < 0:
first_sum = numbers[i]
else:
first_sum = first_sum + numbers[i]
if first_sum > second_sum:
second_sum = first_sum
if second_sum < 0:
second_sum = 0
#输出最大子段和
print(f"The most sum is {second_sum}")
以下代码为笔者用面对对象编程优化后的代码
class Most_sum:
def __init__(self):
self.numbers = []
#第一个函数的作用为输入列表
def get_numbers(self):
while True:
number = input("Enter a number (or 'ok' to end): ")
if number == 'ok':
break
else:
self.numbers.append(int(number))
#第二个函数的作用为计算最大子段和
def get_most_sum(self):
i = 0
first_sum = self.numbers[0]
second_sum = self.numbers[0]
while i < len(self.numbers) - 1:
i = i + 1
if first_sum < 0:
first_sum = self.numbers[i]
else:
first_sum = first_sum + self.numbers[i]
if first_sum > second_sum:
second_sum = first_sum
if second_sum < 0:
second_sum = 0
return second_sum
#得到最大子段和
new_most_sum = Most_sum()
new_most_sum.get_numbers()
print(new_most_sum.get_most_sum())