本文探讨了一种算法问题，即从一个已排序的整数数组中找出最大的K个数值组合，这些组合可以是数组中的单一元素、任意两元素之和或三元素之和。文章进一步介绍了如何通过构建三个不同的堆来分别存储单个元素、两个元素的组合及三个元素的组合，最终将这三个堆合并得到所需的前K大的数值。
You are given an array A of k values which contain int values in sorted (asec) order. Find top k values (asec) which
can either be the number from the array A, or sum of any two numbers from A or sum of any three numbers from A. So, if A's values are represented as : a1,a2,...,ak , the possible numbers can be: a(i), a(i)+a(j), a(i)+a(j)+a(l) for any i,j,l < k
Ex: A[7] = {3,4,5,15,19,20,25}
Ex: A[7] = {3,4,5,15,19,20,25}
output B[7] = {3,4,5,(3+4),(3+5),(4+5),(3+4+5)}
-------------------------------------------------
Get the first k values from A , then name as heap1
Get the first k values from sum of any two numbers from A, then name as heap2
Get the first k values from sum of any three numbers from A, then name as heap3
Merge heap1, heap2, heap3
扫一扫
1095
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
