有两个序列a,b,大小都为n,序列元素的值任意整形数,无序;
要求:通过交换a,b中的元素,使[序列a元素的和]与[序列b元素的和]之间的差最小。
1. 将两序列合并为一个序列,并排序,为序列Source
2. 拿出最大元素Big,次大的元素Small
3. 在余下的序列S[:-2]进行平分,得到序列max,min
4. 将Small加到max序列,将Big加大min序列,重新计算新序列和,和大的为max,小的为min。
思路:
网上有人建立穷举,这种方法不可取,首先,性能低下是一个关键,其次穷举的复杂度也是可想而知的,所以这种思想可以完全屏蔽掉。
拼装两个差值最小的两个序列其实可以现在两个序列合并,然后从小到大排序,然后两个两个来取,把小的append到大的列表,大的append到小的列表,最后拼接出来的列表差值不就是最小了的吗?
带着思路见代码:
#!/usr/bin/python # coding: UTF-8 def mean(sorted_list): if not sorted_list: return [], [] big = sorted_list[-1] small = sorted_list[-2] big_list, small_list = mean(sorted_list[:-2]) big_list.append(small) small_list.append(big) big_list_sum = sum(big_list) small_list_sum = sum(small_list) if big_list_sum > small_list_sum: return big_list, small_list else: return small_list, big_list tests = [[1, 2, 3, 4, 5, 6, 700, 800], [10001, 10000, 100, 90, 50, 1], range(1, 11), [12312, 12311, 232, 210, 30, 29, 3, 2, 1, 1]] for l in tests: l.sort() print "Source List:\t", l l1, l2 = mean(l) print "Result List:\t", l1, l2 print "Distance:\t", abs(sum(l1) - sum(l2)) print '-*' * 40
输出:
C:\Python27\python.exe D:/python_learning/test/cookbook/无序序列元素和最小.py
Source List: [1, 2, 3, 4, 5, 6, 700, 800]
Result List: [1, 4, 5, 800] [2, 3, 6, 700]
Distance: 99
-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Source List: [1, 50, 90, 100, 10000, 10001]
Result List: [50, 90, 10000] [1, 100, 10001]
Distance: 38
-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Source List: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
Result List: [2, 3, 6, 7, 10] [1, 4, 5, 8, 9]
Distance: 1
-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Source List: [1, 1, 2, 3, 29, 30, 210, 232, 12311, 12312]
Result List: [1, 3, 29, 232, 12311] [1, 2, 30, 210, 12312]
Distance: 21
-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Process finished with exit code 0
上面方法可以,善于用递归方法解决问题,但可以还有更直接一点的方法,而且代码量更少容易理解:
#!/usr/bin/python # coding: UTF-8 def mean(sorted_list): minList = [] maxList = [] for i in range(0, len(sorted_list), 2): newsorted_list = sorted_list[i:i + 2] # 截取两个 maxNum = max(newsorted_list) minNum = min(newsorted_list) if sum(maxList) > sum(minList): minList.append(maxNum) maxList.append(minNum) else: maxList.append(maxNum) minList.append(minNum) return maxList, minList tests = [[1, 2, 3, 4, 5, 6, 700, 800], [10001, 10000, 100, 90, 50, 1], range(1, 11), [12312, 12311, 232, 210, 30, 29, 3, 2, 1, 1]] for l in tests: l.sort() print "Source List:\t", l l1, l2 = mean(l) print "Result List:\t", l1, l2 print "Distance:\t", abs(sum(l1) - sum(l2)) print '-*' * 40
输出结果为:
C:\Python27\python.exe D:/python_learning/test/cookbook/函数中途递归.py
Source List: [1, 2, 3, 4, 5, 6, 700, 800]
Result List: [2, 3, 6, 700] [1, 4, 5, 800]
Distance: 99
-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Source List: [1, 50, 90, 100, 10000, 10001]
Result List: [50, 90, 10000] [1, 100, 10001]
Distance: 38
-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Source List: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
Result List: [2, 3, 6, 7, 10] [1, 4, 5, 8, 9]
Distance: 1
-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Source List: [1, 1, 2, 3, 29, 30, 210, 232, 12311, 12312]
Result List: [1, 3, 29, 232, 12311] [1, 2, 30, 210, 12312]
Distance: 21
-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Process finished with exit code 0
答案是一样的,而且更容易理解。
好了,关于这道题就介绍到这里了,有兴趣欢迎交流:
QQ:549982170