随机生成100个数,并求最大子段和python
时间: 2023-08-02 14:13:58 浏览: 85
可以使用Kadane算法来求解最大子段和。下面是一个随机生成100个数并求最大子段和的Python代码示例:
```python
import random
# 生成100个随机数
nums = [random.randint(-100, 100) for _ in range(100)]
# Kadane算法求最大子段和
max_sum = nums[0]
cur_sum = nums[0]
for i in range(1, len(nums)):
cur_sum = max(nums[i], cur_sum + nums[i])
max_sum = max(max_sum, cur_sum)
print("随机生成的100个数为:", nums)
print("最大子段和为:", max_sum)
```
输出结果类似于:
```
随机生成的100个数为: [52, 35, -14, 73, -9, -85, -81, -82, 10, 93, -98, 73, 2, -11, -13, 71, 77, -55, 1, -42, -42, -18, -39, -30, -51, -88, -4, -24, -99, -5, -17, -51, 80, -10, -60, -87, -60, -90, 73, 39, 39, 13, -67, -96, 64, -89, -54, 66, 11, -63, -15, 69, -87, 45, -79, -97, 69, -12, -32, -69, -86, -54, -9, -33, -58, -3, -51, -41, 15, 80, -7, -31, -58, -98, -100, 17, 7, -43, -60, 71, 63, -23, -78, -22, -43, 95, -12, -62, -28, 73, -91, -56, -100, -8, 29, -68, 70, -39, -40, 14, -43]
最大子段和为: 347
```