贪心算法一定要写比较器
import random
def fun1(intervals):
'''贪心策略的题目
我是这样贪心的移除最少,就是选择最多,且不重叠
将其按照末尾结束时间排序
这样每次进行选择之后,剩下的空间最多
'''
'''1.先排好序'''
if intervals==[]:
return 0
intervals.sort(key=paixu)
result=0
point=-float('inf')
'''2.进行遍历'''
for item in intervals:
if point<=item[0]:
result+=1
point=item[1]
return len(intervals)-result
def paixu(item):
return item[1]
def fun2(intervals):
'''
暴力方式将内容全排列
动态规划的方式
:param intervals:
:return:
'''
if intervals==[]:
return 0
intervals.sort(key=pai)
dp=[0]*len(intervals)
for index in range(len(intervals)):
min=0
for j in range(index):
if intervals[j][1]<=intervals[index][0]:
if min<dp[j]:
min=dp[j]
dp[index]=1+min
return len(intervals)-max(dp)
def pai(item):
return item[0]
def main():
for i in range(100):
arr1=suiji()
arr2=arr1.copy()
res1=fun1(arr1)
res2=fun2(arr2)
print(res1,res2,bijiao(res1,res2))
def suiji():
arr=[]
for i in range(random.randint(0,15)):
start=random.randint(-100,100)
end=random.randint(start+1,101)
arr.append([start,end])
return arr
def bijiao(res1,res2):
return res1==res2
main()