算法导论练习题 16.3-7

最新推荐文章于 2021-02-28 08:56:53 发布

VIP文章 niewei1986

最新推荐文章于 2021-02-28 08:56:53 发布

阅读量672

点赞数

分类专栏：算法导论

本文链接：https://blog.csdn.net/niewei1986/article/details/73015918

版权

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 6
typedef struct Huff
{
	int freq;
	Huff *left;
	Huff *middle;
	Huff *right;
	char c;
}HuffNode,*pHuff;

typedef struct 
{
	int len;
	pHuff *arr;
}MinHeap;

void swop(pHuff *a,pHuff *b)
{
	pHuff temp=*a;
	*a=*b;
	*b=temp;
}

void minHeapify(pHuff *a,int len,int i)
{
	if(len<=0)
		return;
	int l=i*2,r=i*2+1,min=a[i]->freq,p=i;
	if(l<len && a[l]->freq<a[i]->freq)
	{
		min=a[l]->freq;
		p=l;
	}
	if(r<len && a[r]->freq<min)
	{
		min=a[r]->freq;
		p=r;
	}
	if(p!=i)
	{
		swop(&a[i],&a[p]);
		minHeapify(a,len,p);
	}
}

MinHeap* buildHeap(int *a,int len,char *cs)
{
	MinHeap *m=(MinHeap *)malloc(sizeof(MinHeap));
	m->arr=(pHuff*)malloc(len*sizeof(pHuff));
	m->len=len;
	for(int i=0;i<len;i++)
	{
		m->arr[i]=(pHuff)malloc(sizeof(