1151 LCA in a Binary Tree (30 分)(C++)
The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.
Given any two nodes in a binary tree, you are supposed to find their LCA.
Input Specification:
Each input file contains one test case. For each case, the first line gives two positive integers: M (≤ 1,000), the number of pairs of nodes to be tested; and N (≤ 10,000), the number of keys in the binary tree, respectively. In each of the following two lines, N distinct integers are given as the inorder and preorder traversal sequences of the binary tree, respectively. It is guaranteed that the binary tree can be uniquely determined by the input sequences. Then M lines follow, each contains a pair of integer keys U and V. All the keys are in the range of int.
Output Specification:
For each given pair of U and V, print in a line LCA of U and V is A.
if the LCA is found and A
is the key. But if A
is one of U and V, print X is an ancestor of Y.
where X
is A
and Y
is the other node. If U or V is not found in the binary tree, print in a line ERROR: U is not found.
or ERROR: V is not found.
or ERROR: U and V are not found.
.
Sample Input:
6 8
7 2 3 4 6 5 1 8
5 3 7 2 6 4 8 1
2 6
8 1
7 9
12 -3
0 8
99 99
Sample Output:
LCA of 2 and 6 is 3.
8 is an ancestor of 1.
ERROR: 9 is not found.
ERROR: 12 and -3 are not found.
ERROR: 0 is not found.
ERROR: 99 and 99 are not found.
解题思路:这是考试的时候的解法,考场上思维很简单,先记录一下每个节点父亲节点,然后要判断哪个值,就不断地访问它的父亲节点,然后得到该节点到根节点的路径。(PS:a,b如果相同,相同节点的写法是"a is an ancestor of b.",考场上写成了LCA格式,幸亏只有一个1分的测试点有影响)
#include <iostream>
#include <vector>
#include <map>
#include <set>
using namespace std;
vector<int>pre,in,w,father;
map<int,int>flag;
int n, m;
void dfs(int instart, int inend, int prestart, int preend, int id){
if(prestart > preend)
return;
int i = instart;
while(i <= inend && in[i] != pre[prestart])
i++;
father[pre[prestart]] = id;
dfs(instart, i - 1, prestart + 1, prestart + i - instart, pre[prestart]);
dfs(i+1, inend, prestart+ i - instart +1, preend, pre[prestart]);
}
int main(){
scanf("%d %d",&m,&n);
pre.resize(n+1);
in.resize(n+1);
father.resize(n+1);
w.resize(n+1);
for(int i = 1; i <= n; i++){
scanf("%d",&w[i]);
in[i] = i;
flag[w[i]] = i;
}
for(int i = 1; i <= n; i++){
int temp;
scanf("%d",&temp);
pre[i] = flag[temp];
}
dfs(1, n, 1, n, -1);
for(int i = 0; i < m; i++){
set<int>temp;
int a, b, aid, bid;
scanf("%d %d",&a,&b);
if(flag.find(a) == flag.end() && flag.find(b) == flag.end())
printf("ERROR: %d and %d are not found.\n",a,b);
else if(flag.find(a) == flag.end())
printf("ERROR: %d is not found.\n",a);
else if(flag.find(b) == flag.end())
printf("ERROR: %d is not found.\n",b);
else{
aid = flag[a]; bid = flag[b];
if(aid == bid){
printf("%d is an ancestor of %d.\n",b,a);
break;
}
int tempaid = aid;
while(aid != -1){
temp.insert(aid);
aid = father[aid];
if(aid == bid){
printf("%d is an ancestor of %d.\n",b,a);
break;
}
}
while(bid != -1){
bid = father[bid];
if(tempaid == bid){
printf("%d is an ancestor of %d.\n",a,b);
break;
}
else if(temp.find(bid) != temp.end()){
printf("LCA of %d and %d is %d.\n",a,b,w[bid]);
break;
}
}
}
}
}
后来拜读了柳神的博客,不得不感叹我考场上的方法真是太麻烦了,还需要继续努力才可以。
一开始我还在好奇为什么是先写中序遍历,一般PAT给树的遍历,都是先给先序,再给中序。原来是为了确定从哪个序号开始是右子树,方便比较。
所谓ica函数,其实可以看做不完全中序先序转后序的过程,与中序先序转后序不同的是,我们不需要遍历所有节点,只需要确定我们需要的节点在它的左子树还是右子树,或者说就是它本身。
中序遍历将某一个序列划分为 “左子树 根节点 右子树”
①:若a,b都小于根节点序号:遍历左子树
②:若a,b都大于根节点序号:遍历右子树
③:若a,b有一个为该根节点的序号,则其为另一个祖先
④:若a, b各在根节点两边,则该根节点就是我们要找到LCA
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int n, m, a, b, aid, bid;
std::vector<int> pre(10005), in(10005);
map<int, int>pos;
void ica(int inleft, int inright, int preleft){
if(inleft > inright)
return;
int i = pos[pre[preleft]];
if(i < aid && i < bid)
ica(i + 1, inright, preleft + i - inleft + 1);
else if(i > aid && i > bid)
ica(inleft, i - 1, preleft + 1);
else if(i == aid)
printf("%d is an ancestor of %d.\n", a, b);
else if(i == bid)
printf("%d is an ancestor of %d.\n", b, a);
else
printf("LCA of %d and %d is %d.\n", a, b, in[i]);
}
int main(){
scanf("%d %d",&n, &m);
for(int i = 1; i <= m; ++ i){
scanf("%d",&in[i]);
pos[in[i]] = i;
}
for(int i = 1; i <= m; ++ i)
scanf("%d",&pre[i]);
for(int i = 0; i < n; ++ i){
scanf("%d %d", &a, &b);
aid = pos[a];
bid = pos[b];
if(aid == 0 && bid == 0)
printf("ERROR: %d and %d are not found.\n", a, b);
else if(aid == 0)
printf("ERROR: %d is not found.\n",a);
else if(bid == 0)
printf("ERROR: %d is not found.\n",b);
else
ica(1, m, 1);
}
}
- Python爬虫(十二)_XPath与lxml类库
- 区块链域名热度不减 健康类英文米近六位交易
- Python爬虫(九)_非结构化数据与结构化数据
- Python爬虫(十)_正则表达式
- python爬虫(四)_urllib2库的基本使用
- 投资人榴莲又卖出一枚三拼域名
- python爬虫(五)_urllib2:Get请求和Post请求
- python爬虫(七)_urllib2:urlerror和httperror
- 双拼市场好!米友售出域名chuijia.com
- Elasticsearch--数据索引
- python爬虫(一)_爬虫原理和数据抓取
- 域名tbw.vip一口价58888元交易
- Tomcat服务器+JSP页面+MySQL数据库网站部署
- 一步步教你理解LSTM
- JavaScript 教程
- JavaScript 编辑工具
- JavaScript 与HTML
- JavaScript 与Java
- JavaScript 数据结构
- JavaScript 基本数据类型
- JavaScript 特殊数据类型
- JavaScript 运算符
- JavaScript typeof 运算符
- JavaScript 表达式
- JavaScript 类型转换
- JavaScript 基本语法
- JavaScript 注释
- Javascript 基本处理流程
- Javascript 选择结构
- Javascript if 语句
- Javascript if 语句的嵌套
- Javascript switch 语句
- Javascript 循环结构
- Javascript 循环结构实例
- Javascript 跳转语句
- Javascript 控制语句总结
- Javascript 函数介绍
- Javascript 函数的定义
- Javascript 函数调用
- Javascript 几种特殊的函数
- JavaScript 内置函数简介
- Javascript eval() 函数
- Javascript isFinite() 函数
- Javascript isNaN() 函数
- parseInt() 与 parseFloat()
- escape() 与 unescape()
- Javascript 字符串介绍
- Javascript length属性
- javascript 字符串函数
- Javascript 日期对象简介
- Javascript 日期对象用途
- Date 对象属性和方法
- Javascript 数组是什么
- Javascript 创建数组
- Javascript 数组赋值与取值
- Javascript 数组属性和方法
- Mysql系列第十七讲 流程控制语句(高手进阶)
- 私藏的5个好用的Pandas函数!
- 漫画:如何在数组中找到和为 “特定值” 的两个数?
- 当你在百度搜索关键字的时候,哪个网站会排在最前面?今天给大家科普一下“网站SEO”
- Mysql系列第十九讲 异常捕获及处理详解
- 【原创】经验分享:一个小小emoji尽然牵扯出来这么多东西?
- jQuery 事件对象,拷贝对象,多库共存
- jQuery 事件注册与事件处理
- v-charts 修改文本颜色
- 使用 jsDelivr 免费加速 GitHub Pages 博客的静态资源(二)
- 竞赛比完,代码、模型怎么处理?Kaggle大神:别删,这都是宝藏
- 显示DataGrid序号的一个适用的方法
- SAP Spartacus cms-components.service.ts里的config.cmsComponents
- ng-template和ng-container的嵌套使用
- SAP Spartacus pageSlot一览