一、最大字段和:找出数组[-2,1,-1,4,-1,2,1,-5,4]中连续子序列的最大值
问题描述:
给定一个数组,求这个数组的连续子数组中,最大的那一段的和。如数组[-2,1,-3,4,-1,2,1,-5,4]:
连续子数组如:[-2,1]、[1,-3,4,-1]、4,-1,2,1]
[-2,1,-3,4,-1,2,1,-5,4],和最大的是[4,1,2,1],为6。
思路:
将求n个数的数组的最大子段和,转换为分别求出以第1个、第2个、…第n个数字结尾的最大字段和,再找出这n个结果中最大的,即为结果。
动态规划算法:
第i个状态(dp[i])即为以第i个数字结尾的最大子段和(最优解)。由于以第i-1个数字结尾的最大子段和(dp[i-1])与numsi]相邻.
nums=[-2,1,-1,4,-1,2,1,-5,4]
dp=[0 for i in range(len(nums))]
dp[0]=nums[0]
dp = [0] * len(nums)
dp[0] = nums[0]
for i in range(1, len(nums)):
dp[i] = max(nums[i], dp[i-1] + nums[i])
print(dp)
result=max(dp)
print(result)
end = dp.index(result)
subarr=[]
for i in range(i, -1, -1):
if dp[i]<0:
subarr=nums[i+1:end+1]
break
print(subarr)
结果
二、在数组[1,5,2,4,3]中返回最长的递增序列长度
10分钟彻底搞懂“动态规划”算法
1.暴力枚举法
memo={}
def find(nums,i):
if i in memo:
return memo[i]
if i==len(nums)-1:
return 1
max_len=1
for j in range(i+1,len(nums)):
if nums[j]<=nums[i]:
continue
else:
max_len=max(max_len,find(nums,j)+1)
memo[i]=max_len
return max_len
def huilujishu(nums):
return max(find(nums,i) for i in range (len(nums)))
nums=[1,5,2,4,3]
print(huilujishu(nums))
2.动态规划法:用空间换时间----自底向上—dp数组
dp[i]=max{dp[i],do[j]+1}
以i=2为例,这里的第二个dp[i]相当于dp[3]+1,也就相当于dp[2]=max{dp[3],dp[4]}+1,若不理解看下图(从后到前)
代码如下:
nums = [1, 5, 2, 4, 3]
dp = [1] * len(nums)
# 计算最长递增子序列的长度
for i in reversed(range(len(nums))):
for j in range(i + 1, len(nums)):
if nums[j] > nums[i]:
dp[i] = max(dp[i], dp[j] + 1)
print(dp)
# 找到最长子序列的最大长度
max_length = max(dp)
# 初始化列表以存储所有可能的最长子序列
sequences = []
def find_sequences(start, current_sequence):
if dp[start] == 1:
sequences.append(current_sequence + [nums[start]])
return
for i in range(start + 1, len(nums)):
if dp[i] == dp[start] - 1:
find_sequences(i, current_sequence + [nums[start]])
# 找到所有最长子序列
for i in range(len(dp)):
if dp[i] == max_length:
find_sequences(i, [])
# 打印结果
print(f"最长递增子序列的长度:{max_length}")
print("所有最长子序列:")
for seq in sequences:
print(seq)
结果如下:
或者(从前到后)
nums = [1, 5, 2, 4, 3]
dp = [1] * len(nums)
# 计算dp数组
for i in range(len(dp)):
for j in range(i):
if nums[j] < nums[i]:
dp[i] = max(dp[i], dp[j] + 1)
print(dp)
max_length = max(dp)
sequences = []
def find_sequences(start, current_sequence):
if dp[start] == max_length:
current_sequence.append(nums[start])
sequences.append(current_sequence[:]) # 复制当前序列
return
for i in range(start + 1, len(nums)):
if dp[i] == dp[start] + 1 and nums[i] > nums[start]:
find_sequences(i, current_sequence + [nums[start]])
# 寻找所有最长递增子序列
for i in range(len(dp)):
if dp[i] == 1:
find_sequences(i, [])
print(f"最长递增子序列的长度:{max_length}")
print("所有最长子序列:")
for seq in sequences:
print(seq)