概述
堆又称完全二叉堆,逻辑上基于完全二叉树,物理上为线性结构(可以理解为按树的层序遍历输出)
分为大根堆(根节点值大于等于子节点)与小根堆(根节点值小于等于子节点)
以下以大根堆用连续数组构造为例
构造堆:
①将新节点放在数组末尾,如果数组从0编号,其左孩子为2i+1,右孩子为2i+2,父节点为(i-1)/2
②比较其左右孩子,选大的,与当前节点比较,比当前节点大,交换;否则不变;交换后孩子节点所属子根堆改变,要重复这一过程,直到包含叶子节点
③从最后一个非叶子节点开始,从后向前遍历数组,重复②操作,(二叉树顺序,从右向左,从下到上)
void adjustHeap(vector<int>& data, int i, int len) {
int tmp = data[i];
//从左孩子节点开始,比较大小,发生交换后,孩子节点变化,子根堆变化,需要调整
for (int k = 2 * i + 1; k < len; k = 2 * k + 1) {
if (k + 1 < len && data[k + 1] > data[k])
k++;
if (data[k] > tmp) {
data[i] = data[k];
i = k;
}
else
break;
}
data[i] = tmp;
}
int main()
{
vector<int> data{1,2,3,4,5,6,7};
//最后一个非叶子节点开始调整
for (int k = data.size() / 2 - 1; k >= 0; k--)
adjustHeap(data, k, data.size());
for (int i = 0; i < data.size(); i++) {
cout << data[i] << ",";
}
return 0;
}
插入
int main()
{
vector<int> data{1,2,3,4,5,6,7};
for (int k = data.size() / 2 - 1; k >= 0; k--)
adjustHeap(data, k, data.size());
for (int i = 0; i < data.size(); i++) {
cout << data[i] << ",";
}
data.push_back(8);
//二叉树从下到上调整其相关节点
for (int k = data.size() / 2 - 1; k >= 0; k = (k - 1) / 2) {
adjustHeap(data, k, data.size());//无交换可提前退出训话,代码略
if (k == 0)
break;
}
cout << endl;
for (int i = 0; i < data.size(); i++) {
cout << data[i] << ",";
}
return 0;
}
删除
将待删除元素方与数组末尾元素交换,长度减一,调整
int main()
{
vector<int> data{1,2,3,4,5,6,7};
//最后一个非叶子节点开始调整
for (int k = data.size() / 2 - 1; k >= 0; k--)
adjustHeap(data, k, data.size());
for (int i = 0; i < data.size(); i++) {
cout << data[i] << ",";
}
cout << endl;
int k = 0;
for (int i = 0; i < data.size();i++) {
if (data[i] == 5) {
k = i;
swap(data[i], data[data.size() - 1]);
break;
}
}
data.resize(data.size() - 1);
adjustHeap(data, k, data.size());
for (int i = 0; i < data.size(); i++) {
cout << data[i] << ",";
}
return 0;
}
堆排序
按升序排列(复杂度Onlog2n):
每次数组首元素与数组最后元素交换,数组大小减一
重新调整为大根堆
int main()
{
vector<int> data{1,2,3,4,5,6,7};
//最后一个非叶子节点开始调整
for (int k = data.size() / 2 - 1; k >= 0; k--)
adjustHeap(data, k, data.size());
for (int i = 0; i < data.size(); i++) {
cout << data[i] << ",";
}
cout << endl;
for (int i = data.size() - 1; i >= 0; i--) {
swap(data[0], data[i]);
adjustHeap(data, 0, i);
}
for (int i = 0; i < data.size(); i++) {
cout << data[i] << ",";
}
return 0;
}
top k应用
n个元素选前k个小的
使用大小为k的数组,放入k个,构造大根堆,接着向后遍历,与堆顶元素比较,大于堆顶舍弃,否则取代堆顶,重新调整堆,遍历完后。堆中元素即前k个小的
int main()
{
vector<int> data{1,2,3,4,5,6,7};
vector<int> top2(data.begin(), data.begin()+2);
for (int k = top2.size() / 2 - 1; k >= 0; k--)
adjustHeap(data, k, top2.size());
for (int i = 2; i <data.size(); i++) {
if (data[i] < top2[0]) {
swap(data[i], top2[0]);
adjustHeap(top2, 0, top2.size());
}
}
for (int i = 0; i < top2.size(); i++) {
cout << top2[i] << ",";
}
return 0;
}