|

楼主 |
发表于 2016-11-22 09:14:39
|
显示全部楼层
本帖最后由 jerryxjr1220 于 2016-11-22 21:30 编辑
解答:(还是用了动态规划的思路:依次和齐威王的最强马进行比较,如果田忌的最强马大过齐威王的最强马就对阵,如果比不过,就用最差马对阵,保留优势马。)
- a = [1,6,5,9,8,11,15]
- b = [2,6,5,7,3,10,8]
- a.sort(reverse=True)
- b.sort(reverse=True)
- c = []
- for i in range(7):
- if a[i]>=b[0]:
- c.append(b.pop())
- else:
- c.append(b.pop(0))
- print 'Qi Wei Wang: \t' + str(a)
- print 'Tian Ji: \t' + str(c)
- win,lose = 0,0
- for i in range(7):
- if a[i] < c[i]:
- win += 1
- else:
- lose += 1
- print 'Tian Ji wins :' + str(win) + ' loses :' + str(lose)
复制代码
输出:
Qi Wei Wang: [15, 11, 9, 8, 6, 5, 1]
Tian Ji: [2, 3, 10, 5, 8, 7, 6]
Tian Ji wins :4 loses :3 |
|