0-1背包问题实现
描述:有n种物品与承重为m的背包。每种物品只有一件,每个物品都有对应的重量weight[i]与价值value[i],求解如何装包使得价值最大。
思路:
参考https://mp.weixin.qq.com/s/Lo06M_jcGf7ZYm6YH2s7aw 可知,选择策略有三种:最小重量、最大价值和最大价值密度,本题选择最大价值密度,即S i=value i/weight i。
代码:
class Goods:
def __init__(self, weight, value, status):
self.weight = weight
self.value = value
# 0表示未放入包,1表示已经放入包
self.status = status
class Greedy(object):
def greed(self, goods, total):
result = []
sum_weight = 0
sum_value = 0
while True:
s = self.strategy(goods, total)
if s == -1:
break
sum_weight += goods[s].weight
sum_value += goods[s].value
# 保留两位有效数字
res = round(goods[s].value / goods[s].weight,2)
result.append(res)
total = total - goods[s].weight
goods[s].status = 1
goods.pop(s)
return result,sum_weight,sum_value
#选择策略用最大价值密度
def strategy(self, goods, total):
index = -1
minWeight = goods[0].weight
maxValue = goods[0].value
maxSi = maxValue / minWeight
for i in range(0, len(goods)):
currentGood = goods[i]
if currentGood.status == 0 and currentGood.weight <= total and currentGood.value / currentGood.weight > maxSi:
index = i
maxSi = currentGood.value / currentGood.weight
if currentGood.value / currentGood.weight <= maxSi and currentGood.weight==total:
index = i
return index
分割回文串 II (132)
给定一个字符串 s,将 s 分割成一些子串,使每个子串都是回文串。返回符合要求的最少分割次数。
回文数:即是给定一个数,这个数顺读和逆读都是一样的。
示例:
输入: “aab”
输出: 1
解释: 进行一次分割就可将 s 分割成 [“aa”,“b”] 这样两个回文子串。
思路:参考https://blog.csdn.net/wycgi/article/details/85233972
代码:
class Solution(object):
def minCut(self, s):
"""
:type s: str
:rtype: int
"""
if s == s[::-1]:
return 0
for i in range(len(s)):
if s[:i] == s[:i][::-1] and s[i:] == s[i:][::-1]:
return 1
ispal = [[False for j in range(len(s))] for i in range(len(s))]
dp = list(range(len(s))) + [-1]
for i in range(len(s)):
for j in range(i, -1, -1):
if s[i] == s[j] and (i-j <= 1 or ispal[i-1][j+1]):
ispal[i][j] = True
dp[i] = min(dp[i], dp[j-1]+1)
return dp[len(s)-1]
结果: