练习4.3-堆中的路径-编程题

解题代码

#include<stdio.h>
#include<stdlib.h>
#define MINH -10001
typedef struct heap* pheap;
struct heap {
	int* data;
	int size;
};
pheap CreatHeap(int N);
void InsertMin(pheap H, int D);
void OutputPath(pheap H, int I);
int main()
{
	int N;//n of ele
	int M;//n of path
	scanf("%d %d", &N, &M);
	pheap H = CreatHeap(N);
	int i, temp_data;
	for (i = 0; i < N; i++) {
		scanf("%d", &temp_data);
		InsertMin(H,temp_data);
	}
	int temp_index;
	int flag = 1;
	for (i = 0; i < M; i++) {
		scanf("%d", &temp_index);
		if (flag) flag = 0;
		else printf("\n");
		OutputPath(H, temp_index);
	}
	return 0;
}
pheap CreatHeap(int N) {
	pheap H = (pheap)malloc(sizeof(struct heap));
	H->data = malloc((N + 1) * sizeof(int));
	H->size = 0;
	H->data[0] = MINH;
	return H;
}
void InsertMin(pheap H, int D) {
	if (H->size == 1000) return;
	int i;
	for (i = ++H->size ; H->data[i / 2] > D; i /= 2) H->data[i] = H->data[i / 2];
	H->data[i] = D;
}
void OutputPath(pheap H, int I) {
	int flag = 1;
	int i;
	for (i = I; i >= 1; i /= 2) {
		if (flag) flag = 0;
		else printf(" ");
		printf("%d", H->data[i]);
	}
}

测试结果

问题整理

1.第一次参考了视频，下次遇到要会哦~其实还是挺简单的，主要要理解大顶堆和小顶堆的结构。