1155 Heap Paths (30 分)

最新推荐文章于 2024-07-17 18:07:42 发布

Mryioo

最新推荐文章于 2024-07-17 18:07:42 发布

阅读量62

点赞数

分类专栏： PAT刷题文章标签： c++ 算法数据结构

本文链接：https://blog.csdn.net/weixin_43947762/article/details/120115390

版权

PAT刷题专栏收录该内容

18 篇文章 0 订阅

订阅专栏

1155 Heap Paths (30 分)

In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C. A common implementation of a heap is the binary heap, in which the tree is a complete binary tree. (Quoted from Wikipedia at https://en.wikipedia.org/wiki/Heap_(data_structure))

One thing for sure is that all the keys along any path from the root to a leaf in a max/min heap must be in non-increasing/non-decreasing order.

Your job is to check every path in a given complete binary tree, in order to tell if it is a heap or not.

Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (1<N≤1,000), the number of keys in the tree. Then the next line contains N distinct integer keys (all in the range of int), which gives the level order traversal sequence of a complete binary tree.

Output Specification:
For each given tree, first print all the paths from the root to the leaves. Each path occupies a line, with all the numbers separated by a space, and no extra space at the beginning or the end of the line. The paths must be printed in the following order: for each node in the tree, all the paths in its right subtree must be printed before those in its left subtree.

Finally print in a line Max Heap if it is a max heap, or Min Heap for a min heap, or Not Heap if it is not a heap at all.

Sample Input 1:
8
98 72 86 60 65 12 23 50
Sample Output 1:
98 86 23
98 86 12
98 72 65
98 72 60 50
Max Heap
Sample Input 2:
8
8 38 25 58 52 82 70 60
Sample Output 2:
8 25 70
8 25 82
8 38 52
8 38 58 60
Min Heap
Sample Input 3:
8
10 28 15 12 34 9 8 56
Sample Output 3:
10 15 8
10 15 9
10 28 34
10 28 12 56
Not Heap

题目大意：给定一个序列，判断是大、小顶堆或非堆，输出其先右后左的DFS序列。
思路①：暴力破解：直接用所给序列分别构造大小顶堆与原序列对比。最后递归输出，注意对只有左子树的结点特判。

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> heap, temp;
int n;
void maxHeapDownAdjust(int low, int high) {
	int i = low, j = i * 2;
	while (j <= high) {
		if (j + 1 <= high && temp[j + 1] > temp[j]) j = j + 1;
		if (temp[j] > temp[i]) {
			swap(temp[j], temp[i]);
			i = j;
			j = 2 * i;
		}
		else break;
	}
}

void minHeapDownAdjust(int low, int high) {
	int i = low, j = i * 2;
	while (j <= high) {
		if (j + 1 <= high && temp[j + 1] < temp[j]) j = j + 1;
		if (heap[j] < heap[i]) {
			swap(temp[j], temp[i]);
			i = j;
			j = 2 * i;
		}
		else break;
	}
}

void createMaxHeap() {
	for (int i = n / 2;i > 0;--i) {
		maxHeapDownAdjust(i, n);
	}
}

void createMinHeap() {
	for (int i = n / 2;i > 0;--i) {
		minHeapDownAdjust(i, n);
	}
}
vector<int> path;
void print(int v) {
	if (2 * v > n && 2 * v + 1 > n) {
		path.push_back(heap[v]);
		for (int i = 0;i < path.size();++i) {
			if (i > 0) printf(" ");
			printf("%d", path[i]);
		}
		printf("\n");
		path.pop_back();
		return;
	}
	path.push_back(heap[v]);
	if (2 * v + 1 <= n) print(2 * v + 1);
	print(2 * v);
	path.pop_back();
}

int main() {
	heap.push_back(0);//搁置0位 
	scanf("%d", &n);
	for (int i = 1;i <= n;++i) {
		int num;
		scanf("%d", &num);
		heap.push_back(num);
	}
	print(1);
	if (temp = heap, createMaxHeap(), temp == heap) {
		printf("Max Heap");
	}
	else if (temp = heap, createMinHeap(), temp == heap) {
		printf("Min Heap");
	}
	else {
		printf("Not Heap");
	}
	return 0;
}

思路②：从一号位遍历，如果有元素比父结点小，则不是小顶堆，如果有不比父结点大，则不是大顶堆；

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> heap, temp;
int n;
bool maxHeap = true, minHeap = true;
vector<int> path;
void print(int v) {
	if (2 * v > n && 2 * v + 1 > n) {
		path.push_back(heap[v]);
		for (int i = 0;i < path.size();++i) {
			if (i > 0) printf(" ");
			printf("%d", path[i]);
		}
		printf("\n");
		path.pop_back();
		return;
	}
	path.push_back(heap[v]);
	if (2 * v + 1 <= n) print(2 * v + 1);
	print(2 * v);
	path.pop_back();
}
void judge() {
	for (int i = 2;i <= n;++i) {
		if (heap[i / 2] > heap[i]) minHeap = false;
		if (heap[i / 2] < heap[i]) maxHeap = false;
	}
}
int main() {
	heap.push_back(0);//搁置0位 
	scanf("%d", &n);
	for (int i = 1;i <= n;++i) {
		int num;
		scanf("%d", &num);
		heap.push_back(num);
	}
	print(1);
	judge();
	if (minHeap == true) printf("Min Heap");
	else if (maxHeap == true) printf("Max Heap");
	else printf("Not Heap");
	return 0;
}