7-5-堆中的路径-编程题

解题代码

#include<stdio.h>
#include<stdlib.h>
typedef struct heap* ph;
struct heap {
	int* data;
	int capable;
	int size;
};
ph Creatheap(int N);
void InsertMinHeap(ph H);
void PrintPath(ph H);
int main()
{
	int N;//n of nodes of heap
	int	M;//n of index as case
	scanf("%d %d", &N,&M);
	ph H = Creatheap(N);
	int i, flag=1;
	for (i = 0; i < N; i++) InsertMinHeap(H);
	for (i = 0; i < M; i++) {
		if (flag) flag = 0;
		else printf("\n");
		PrintPath(H);
	}
	return 0;
}
ph Creatheap(int N) {
	ph H = (ph)malloc(sizeof(struct heap));
	H->capable = N;
	H->data = malloc((N + 1) * sizeof(int));
	H->data[0] = -10001;
	H->size = 0;
	return H;
}
void InsertMinHeap(ph H) {
	int temp_data;
	scanf("%d", &temp_data);
	int i;
	for (i = ++H->size; H->data[i / 2] > temp_data; i /= 2) H->data[i] = H->data[i / 2];
	H->data[i] = temp_data;
}
void PrintPath(ph H) {
	int index;
	scanf("%d", &index);
	int i = index, flag = 1;
	while (i > 0) {
		if (flag) flag = 0;
		else printf(" ");
		printf("%d", H->data[i]);
		i /= 2;
	}
}

测试结果

问题整理

1.输入别搞丢了。。。这问题倒是很快能debug出来。