目录
1. void HeapPush(HP* php, HPDataType x)
3.void HeapSort(int* a, int n)
1. 堆的概念及结构
1.堆的概念
2.堆的性质
1.堆中某个节点的值总是不大于或不小于其父节点的值
2.堆是一棵完全二叉树。
大堆:
树中所有的父亲的指都大于等于孩子的值
小堆:
树中所有的父亲的指都小于等于孩子的值
堆的性质理解:
2.如何实现一个堆(大堆)
由于之前的顺序表,链表,栈,队列已经学过了,那么此次省略基本的构建,只写故案件的部分。
1. void HeapPush(HP* php, HPDataType x)
堆的插入(尾插):
2.void HeapPop(HP* php)
删除堆顶数据(头删)
堆适合做的事情:选数
1.排序
2.topK问题(选出前K个最大或者最小的数)
3.void HeapSort(int* a, int n)
1.建堆和堆排序
void HeapSort(int* a, int n)
{
// 向上调整建堆 -- N*logN
/*for (int i = 1; i < n; ++i)
{
AdjustUp(a, i);
}*/
// 向下调整建堆 -- O(N)
// 升序:建大堆
for (int i = (n - 1 - 1) / 2; i >= 0; --i)
{
AdjustDown(a, n, i);
}
// O(N*logN)
int end = n - 1;
while (end > 0)
{
Swap(&a[0], &a[end]);
AdjustDown(a, end, 0);
--end;
}
}
2. 求向下调整建堆(向上调整)的时间复杂度
3.用堆升序(建大堆)
4.topK问题(用堆解决)
1.用数据集合中前K个元素来建堆
前k个最大的元素,则建小堆 前k个最小的元素,则建大堆
2. 用剩余的N-K个元素依次与堆顶元素来比较,不满足则替换堆顶元素
将剩余N-K个元素依次与堆顶元素比完之后,堆中剩余的K个元素就是所求的前K个最小或者最大的元素。
//void TestHeap5()
//{
// int minHeap[5];
// FILE* fout = fopen("data.txt", "r");
// if (fout == NULL)
// {
// perror("fopen fail");
// return;
// }
// int k = 5;
// for (int i = 0; i < k; ++i)
// {
// fscanf(fout, "%d", &minHeap[i]);
// }
//
// // 建小堆
// for (int i = (k - 1 - 1) / 2; i >= 0; --i)
// {
// AdjustDown(minHeap, k, i);
// }
//
// int val = 0;
// while (fscanf(fout, "%d", &val) != EOF)
// {
// if (val > minHeap[0])
// {
// minHeap[0] = val;
// AdjustDown(minHeap, k, 0);
// }
// }
//
// for (int i = 0; i < k; ++i)
// {
// printf("%d ", minHeap[i]);
// }
// printf("\n");
//
// fclose(fout);
//}
void TestHeap5()
{
// 造数据
int n, k;
printf("请输入n和k:>");
scanf("%d%d", &n, &k);
srand(time(0));
FILE* fin = fopen("data.txt", "w");
if (fin == NULL)
{
perror("fopen fail");
return;
}
int randK = k;
for (size_t i = 0; i < n; ++i)
{
int val = rand() % 100000;
fprintf(fin, "%d\n", val);
}
fclose(fin);
/
// 找topk
FILE* fout = fopen("data.txt", "r");
if (fout == NULL)
{
perror("fopen fail");
return;
}
//int minHeap[5];
int* minHeap = malloc(sizeof(int)*k);
if (minHeap == NULL)
{
perror("malloc fail");
return;
}
for (int i = 0; i < k; ++i)
{
fscanf(fout, "%d", &minHeap[i]);
}
// 建小堆
for (int i = (k - 1 - 1) / 2; i >= 0; --i)
{
AdjustDown(minHeap, k, i);
}
int val = 0;
while (fscanf(fout, "%d", &val) != EOF)
{
if (val > minHeap[0])
{
minHeap[0] = val;
AdjustDown(minHeap, k, 0);
}
}
for (int i = 0; i < k; ++i)
{
printf("%d ", minHeap[i]);
}
printf("\n");
fclose(fout);
}
3.实现代码
Heap.h
#pragma once
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#include<stdbool.h>
#include<string.h>
typedef int HPDataType;
typedef struct Heap
{
HPDataType* a;
int size;
int capacity;
}HP;
void AdjustDown(HPDataType* a, int n, int parent);
void AdjustUp(HPDataType* a, int child);
void Swap(HPDataType* p1, HPDataType* p2);
// 堆的构建
void HeapCreate(HP* hp, HPDataType* a, int n);
//堆dayin
void HeapPrint(HP* php);
//堆初始化
void HeapInit(HP* php);
//堆销毁
void HeapDestroy(HP* php);
// 保持他继续是一个堆 O(logN)
void HeapPush(HP* php, HPDataType x);
// 删除堆顶的数据,并且保持他继续是一个堆 O(logN)
void HeapPop(HP* php);
HPDataType HeapTop(HP* php);
int HeapSize(HP* hp);
// 堆的判空
bool HeapEmpty(HP* hp);
Heap.c
#pragma once
#include "Heap.h"
// 堆的构建
//void HeapCreate(HP* php, HPDataType* a, int n)
//{
// assert(php);
// HeapInit(php);
// for (int i = 0; i < n; ++i)
// {
// HeapPush(php, a[i]);
// }
//}
void HeapCreate(HP* php, HPDataType* a, int n)
{
assert(php);
php->a = (HPDataType*)malloc(sizeof(HPDataType) * n);
if (php->a == NULL)
{
perror("malloc fail");
exit(-1);
}
memcpy(php->a, a, sizeof(HPDataType) * n);
php->size = php->capacity = n;
// 建堆算法
for (int i = (n - 1 - 1) / 2; i >= 0; --i)
{
AdjustDown(php->a, n, i);
}
}
void HeapPrint(HP* php)
{
assert(php);
for (int i = 0; i < php->size; ++i)
{
printf("%d ", php->a[i]);
}
printf("\n");
}
void HeapInit(HP* php)
{
assert(php);
php->a = NULL;
php->size = php->capacity = 0;
}
void HeapDestroy(HP* php)
{
assert(php);
free(php->a);
php->a = NULL;
php->size = php->capacity = 0;
}
void Swap(HPDataType* p1, HPDataType* p2)
{
HPDataType tmp = *p1;
*p1 = *p2;
*p2 = tmp;
}
void AdjustUp(HPDataType* a, int child)
{
int parent = (child - 1) / 2;
//while (parent >= 0) 不好
while (child > 0)
{
if (a[child] > a[parent])
{
Swap(&a[child], &a[parent]);
child = parent;
parent = (child - 1) / 2;
}
else
{
break;
}
}
}
void HeapPush(HP* php, HPDataType x)
{
assert(php);
// 扩容
if (php->size == php->capacity)
{
int newCapacity = php->capacity == 0 ? 4 : php->capacity * 2;
HPDataType* tmp = (HPDataType*)realloc(php->a, sizeof(HPDataType) * newCapacity);
if (tmp == NULL)
{
perror("realloc fail");
exit(-1);
}
php->a = tmp;
php->capacity = newCapacity;
}
php->a[php->size] = x;
php->size++;
AdjustUp(php->a, php->size - 1);
}
void AdjustDown(HPDataType* a, int n, int parent)
{
int child = parent * 2 + 1;
while (child < n)
{
// 确认child指向大的那个孩子
if (child + 1 < n && a[child + 1] < a[child])
{
++child;
}
// 1、孩子大于父亲,交换,继续向下调整
// 2、孩子小于父亲,则调整结束
if (a[child] < a[parent])
{
Swap(&a[child], &a[parent]);
parent = child;
child = parent * 2 + 1;
}
else
{
break;
}
}
}
void HeapPop(HP* php)
{
assert(php);
assert(php->size > 0);
Swap(&php->a[0], &php->a[php->size - 1]);
php->size--;
AdjustDown(php->a, php->size, 0);
}
HPDataType HeapTop(HP* php)
{
assert(php);
assert(php->size > 0);
return php->a[0];
}
int HeapSize(HP* php)
{
assert(php);
return php->size;
}
// 堆的判空
bool HeapEmpty(HP* php)
{
assert(php);
return php->size == 0;
}
Test.c
#define _CRT_SECURE_NO_WARNINGS 1
#include <time.h>
#include "Heap.h"
void TestHeap1()
{
int array[] = { 27, 15, 19, 18, 28, 34, 65, 49, 25, 37 };
HP hp;
HeapInit(&hp);
for (int i = 0; i < sizeof(array) / sizeof(int); ++i)
{
HeapPush(&hp, array[i]);
}
HeapPrint(&hp);
// topK 快
int k = 5;
while (k--)
{
printf("%d ", HeapTop(&hp));
HeapPop(&hp);
}
HeapDestroy(&hp);
}
void TestHeap2()
{
int array[] = { 27, 15, 19, 18, 28, 34, 65, 49, 25, 37 };
HP hp;
HeapInit(&hp);
for (int i = 0; i < sizeof(array) / sizeof(int); ++i)
{
HeapPush(&hp, array[i]);
}
while (!HeapEmpty(&hp))
{
printf("%d ", HeapTop(&hp));
HeapPop(&hp);
}
HeapDestroy(&hp);
}
void TestHeap3()
{
int array[] = { 27, 15, 19, 18, 28, 34, 65, 49, 25, 37 };
HP hp;
HeapCreate(&hp, array, sizeof(array) / sizeof(int));
HeapPrint(&hp);
HeapDestroy(&hp);
}
// O(N*logN)
void HeapSort(int* a, int n)
{
// 向上调整建堆 -- N*logN
/*for (int i = 1; i < n; ++i)
{
AdjustUp(a, i);
}*/
// 向下调整建堆 -- O(N)
// 升序:建大堆
for (int i = (n - 1 - 1) / 2; i >= 0; --i)
{
AdjustDown(a, n, i);
}
// O(N*logN)
int end = n - 1;
while (end > 0)
{
Swap(&a[0], &a[end]);
AdjustDown(a, end, 0);
--end;
}
}
void TestHeap4()
{
int array[] = { 27, 15, 19, 18, 28, 34, 65, 49, 25, 37 };
HeapSort(array, sizeof(array) / sizeof(int));
for (int i = 0; i < sizeof(array) / sizeof(int); ++i)
{
printf("%d ", array[i]);
}
printf("\n");
}
//void TestHeap5()
//{
// int minHeap[5];
// FILE* fout = fopen("data.txt", "r");
// if (fout == NULL)
// {
// perror("fopen fail");
// return;
// }
//
// for (int i = 0; i < k; ++i)
// {
// fscanf(fout, "%d", &minHeap[i]);
// }
//
// // 建小堆
// for (int i = (k - 1 - 1) / 2; i >= 0; --i)
// {
// AdjustDown(minHeap, k, i);
// }
//
// int val = 0;
// while (fscanf(fout, "%d", &val) != EOF)
// {
// if (val > minHeap[0])
// {
// minHeap[0] = val;
// AdjustDown(minHeap, k, 0);
// }
// }
//
// for (int i = 0; i < k; ++i)
// {
// printf("%d ", minHeap[i]);
// }
// printf("\n");
//
// fclose(fout);
//}
void TestHeap5()
{
// 造数据
int n, k;
printf("请输入n和k:>");
scanf("%d%d", &n, &k);
srand(time(0));
FILE* fin = fopen("data.txt", "w");
if (fin == NULL)
{
perror("fopen fail");
return;
}
int randK = k;
for (size_t i = 0; i < n; ++i)
{
int val = rand() % 100000;
fprintf(fin, "%d\n", val);
}
fclose(fin);
/
// 找topk
FILE* fout = fopen("data.txt", "r");
if (fout == NULL)
{
perror("fopen fail");
return;
}
//int minHeap[5];
int* minHeap = malloc(sizeof(int) * k);
if (minHeap == NULL)
{
perror("malloc fail");
return;
}
for (int i = 0; i < k; ++i)
{
fscanf(fout, "%d", &minHeap[i]);
}
// 建小堆
for (int i = (k - 1 - 1) / 2; i >= 0; --i)
{
AdjustDown(minHeap, k, i);
}
int val = 0;
while (fscanf(fout, "%d", &val) != EOF)
{
if (val > minHeap[0])
{
minHeap[0] = val;
AdjustDown(minHeap, k, 0);
}
}
for (int i = 0; i < k; ++i)
{
printf("%d ", minHeap[i]);
}
printf("\n");
fclose(fout);
}
int main()
{
TestHeap5();
return 0;
}