05-树7-堆中的路径-编程题

解题代码

#include<stdio.h>
#include<stdlib.h>
typedef struct heap* ph;
struct heap {
	int* data;
	int rear;
	int capacity;
};
ph CreatHeap(int N);
void InsertMin(ph H);
void Print(ph H);
int main()
{
	int N;//n of data;
	int M;//n of path needed print
	scanf("%d %d", &N, &M);
	ph H = CreatHeap(N);
	int i, flag = 1;
	for (i = 0; i < N; i++) InsertMin(H);
	for (i = 0; i < M; i++) {
		if (flag) flag = 0;
		else printf("\n");
		Print(H);
	}
	return 0;
}
ph CreatHeap(int N) {
	ph H = (ph)malloc(sizeof(struct heap));
	H->capacity = N;
	H->data = malloc((N + 1) * sizeof(int));
	H->rear = 0;
	H->data[0] = -10001;
	return H;
}
void InsertMin(ph H) {
	int temp_data;
	scanf("%d", &temp_data);
	int i;
	for (i = ++H->rear; H->data[i / 2] > temp_data; i /= 2) H->data[i] = H->data[i / 2];
	H->data[i] = temp_data;
}
void Print(ph H) {
	int flag = 1, i;
	int index;
	scanf("%d", &index);
	for (i = index; i > 0; i/=2) {
		if (flag) flag = 0;
		else printf(" ");
		printf("%d", H->data[i]);
	}
}

测试结果

问题整理

1.这题写好多次了，目前挺熟练了。。