PAT甲级——A1155 HeapPaths【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), 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
Solution:
10 15 9
10 28 34
10 28 12 56
Not Heap
这道题很简单,和前面的一道题类似
抓住两个重要条件:
一个是大根堆,小根堆的特点
一个是完全二叉树的性质
然后通过层序遍历序列重构二叉树
通过序列中第一个数与第二个数的大小比较就可以知道是大根堆还是小根堆【注意,一般不要相信题目中所谓的等于,因为PAT中的节点值就从来没有等于过】
通过判断节点与其孩子节点的值的大小可知是否满足Heap Tree的性质
最后使用DFS来输出路径,记得先右再左
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
struct Node
{
int val;
Node *l, *r;
Node(int a = ) :val(a), l(nullptr), r(nullptr) {}
};
int n;
vector<int>level;
Node *creatTree(int index)//重构二叉树
{
Node *root = new Node(level[index++]);
queue<Node*>q;
q.push(root);
while (!q.empty() && index<n)
{
Node *p = q.front();
q.pop();
p->l = new Node(level[index++]);
q.push(p->l);
if (index >= n)break;
p->r = new Node(level[index++]);
q.push(p->r);
}
return root;
}
vector<int>res;
void DFS(Node *root, bool isMaxHeap,bool &isHeap)
{
if (root == nullptr)
return;
res.push_back(root->val);
if (isMaxHeap)//大根堆判断
{
if ((root->l && root->l->val > root->val) || (root->r && root->r->val > root->val))
isHeap = false;
}
else//小根堆判断
{
if ((root->l && root->l->val < root->val) || (root->r && root->r->val < root->val))
isHeap = false;
}
if (root->l == nullptr && root->r == nullptr)//输出路径
{
for (int i = ; i < res.size(); ++i)
cout << (i == ? "" : " ") << res[i];
cout << endl;
}
DFS(root->r, isMaxHeap, isHeap);//记得先右再左
DFS(root->l, isMaxHeap, isHeap);
res.pop_back();
}
int main()
{
cin >> n;
level.resize(n);
for (int i = ; i < n; ++i)
cin >> level[i];
Node* root = creatTree();
bool isHeap = true;
bool isMaxHeap = level[] >= level[] ? : ;
DFS(root, isMaxHeap, isHeap);
if (isHeap && isMaxHeap)
cout << "Max Heap" << endl;
else if (isHeap && !isMaxHeap)
cout << "Min Heap" << endl;
else
cout << "Not Heap" << endl;
return ;
}
原谅孩子不会静态重构二叉树吧 :), 静态重构【就是根据序列数位置得到整个数树的形状】是我的硬伤,相信不久的明天我就学会了 ^_^
这里借用一下别人静态重构的代码吧
#include <iostream>
#include <vector>
using namespace std;
vector<int> v;
int a[], n, isMin = , isMax = ;
void dfs(int index) {
if (index * > n && index * + > n) {
if (index <= n) {
for (int i = ; i < v.size(); i++)
printf("%d%s", v[i], i != v.size() - ? " " : "\n");
}
}
else {
v.push_back(a[index * + ]);
dfs(index * + );
v.pop_back();
v.push_back(a[index * ]);
dfs(index * );
v.pop_back();
}
}
int main() {
cin >> n;
for (int i = ; i <= n; i++)
scanf("%d", &a[i]);
v.push_back(a[]);
dfs();
for (int i = ; i <= n; i++) {
if (a[i / ] > a[i]) isMin = ;
if (a[i / ] < a[i]) isMax = ;
}
if (isMin == )
printf("Min Heap");
else
printf("%s", isMax == ? "Max Heap" : "Not Heap");
return ;
}
PAT甲级——A1155 HeapPaths【30】的更多相关文章
- PAT 甲级 1147 Heaps (30 分) (层序遍历,如何建树,后序输出,还有更简单的方法~)
1147 Heaps (30 分) In computer science, a heap is a specialized tree-based data structure that sati ...
- PAT 甲级1057 Stack (30 分)(不会,树状数组+二分)*****
1057 Stack (30 分) Stack is one of the most fundamental data structures, which is based on the prin ...
- pat 甲级 1057 Stack(30) (树状数组+二分)
1057 Stack (30 分) Stack is one of the most fundamental data structures, which is based on the princi ...
- PAT甲级:1064 Complete Binary Search Tree (30分)
PAT甲级:1064 Complete Binary Search Tree (30分) 题干 A Binary Search Tree (BST) is recursively defined as ...
- PAT甲级题解(慢慢刷中)
博主欢迎转载,但请给出本文链接,我尊重你,你尊重我,谢谢~http://www.cnblogs.com/chenxiwenruo/p/6102219.html特别不喜欢那些随便转载别人的原创文章又不给 ...
- PAT甲级1127. ZigZagging on a Tree
PAT甲级1127. ZigZagging on a Tree 题意: 假设二叉树中的所有键都是不同的正整数.一个唯一的二叉树可以通过给定的一对后序和顺序遍历序列来确定.这是一个简单的标准程序,可以按 ...
- PAT甲级1119. Pre- and Post-order Traversals
PAT甲级1119. Pre- and Post-order Traversals 题意: 假设二叉树中的所有键都是不同的正整数.一个唯一的二进制树可以通过给定的一对后序和顺序遍历序列来确定,也可以通 ...
- PAT甲级1057. Stack
PAT甲级1057. Stack 题意: 堆栈是最基础的数据结构之一,它基于"先进先出"(LIFO)的原理.基本操作包括Push(将元素插入顶部位置)和Pop(删除顶部元素).现在 ...
- PAT甲级1026. Table Tennis
PAT甲级1026. Table Tennis 题意: 乒乓球俱乐部有N张桌子供公众使用.表的编号从1到N.对于任何一对玩家,如果有一些表在到达时打开,它们将被分配给具有最小数字的可用表.如果所有的表 ...
随机推荐
- 8786:方格取数 (多线程dp)
[题目描述] 设有N*N的方格图(N<=10),我们将其中的某些方格中填入正整数,而其他的方格中则放入数字0.某人从图的左上角的A 点出发,可以向下行走,也可以向右走,直到到达右下角的B点.在走 ...
- Springboot-技术专区-war包部署在Tomcat上并修改默认端口
springboot项目内置Tomcat,直接打成jar包在dos下运行即可,但有时我们需要用war包以非内嵌Tomcat的方式来部署,以下是本人的实际经验 1.首先需要修改pom.xml文件 < ...
- Android应用程序开发中碰到的错误和获得的小经验
1,Installation error: INSTALL_FAILED_INSUFFICIENT_STORAGE Description:这表示手机内存不足,对内存较小的手机经常会出现这样的问题,从 ...
- JVM(1)之 JAVA栈
开发十年,就只剩下这套架构体系了! >>> 若想使自己编写的Java程序高效运行,以及进行正确.高效的异常诊断,JVM是不得不谈的一个话题.本"JVM进阶"专 ...
- Linux拷贝、移动、删除
cp:拷贝文件或文件夹(copy) - cp original_filename copy_filename(在当前目录生成拷贝文件,并改名为copy_filename) - cp original_ ...
- ubuntu开发c/c++帮助文档
1.C语言库函数基本的帮助文档 sudo apt-get install manpages sudo apt-get install manpages-de sudo apt-get install ...
- 17-正交矩阵和Gram-Schmidt正交化
一.视频链接 1)正交矩阵 定义:如果一个矩阵,其转置与自身的乘积等于单位向量,那么该矩阵就是正交矩阵,该矩阵一般用Q来表示,即$Q^TQ=QQ^T=I$,也就是$Q^T=Q^{-1}$,即转置=逆 ...
- Git--01 基础 - 远程仓库的使用
目录 Git 基础 - 远程仓库的使用 远程仓库的使用 查看远程仓库 添加远程仓库 从远程仓库中抓取与拉取 推送到远程仓库 查看某个远程仓库 远程仓库的移除与重命名 Git 基础 - 远程仓库的使用 ...
- 2017ICPC沈阳赛现场赛 L-Tree (dfs)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6228 题目大意:给一棵树,需要用k种颜色给树上的节点染色,问你在最优的染色方案下,相同颜色的节点连接的 ...
- SpringBoot中jar包转war包
参考博客 https://blog.csdn.net/qq_33689414/article/details/81812761 https://blog.csdn.net/u013412772/art ...