PAT甲级1143 Lowest Common Ancestor (30 分)

最新推荐文章于 2022-04-07 15:48:26 发布

原创最新推荐文章于 2022-04-07 15:48:26 发布 · 543 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

PAT甲级

本文探讨了在二叉搜索树(BST)中查找两个节点的最低公共祖先(LCA)的算法。通过分析BST特性及前序遍历序列，提出了一种高效查找LCA的方法，并提供了实现代码。

1143 Lowest Common Ancestor (30 分)

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.

A binary search tree (BST) is recursively defined as a binary tree which has the following properties:

The left subtree of a node contains only nodes with keys less than the node's key.
The right subtree of a node contains only nodes with keys greater than or equal to the node's key.
Both the left and right subtrees must also be binary search trees.

Given any two nodes in a BST, 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 BST, respectively. In the second line, N distinct integers are given as the preorder traversal sequence of the BST. 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 BST, 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

6 3 1 2 5 4 8 7

2 5

8 7

1 9

12 -3

0 8

99 99

Sample Output:

LCA of 2 and 5 is 3.

8 is an ancestor of 7.

ERROR: 9 is not found.

ERROR: 12 and -3 are not found.

ERROR: 0 is not found.

ERROR: 99 and 99 are not found

题目大意：

        给出m次查询与长度为n的前序序列。找到最近的公共祖先。

思路：

利用BST的特点以及给出的是前序，读到的点a 与b 他们的祖先一定是介于两者之间的，或者是a或b。遍历前序找到复合的值即可。
利用map来记录是否出现在BST中，根据读到的mp[a]，mp[b]做出相应的。。

参考代码：

#include<vector>
#include<cstdio>
#include<map>
using namespace std;
vector<int> pre;
map<int, bool> mp;
int m, n;
int main(){
	scanf("%d%d", &m, &n);
	pre.resize(n);
	for(int i = 0; i < n; ++i)	scanf("%d", &pre[i]), mp[pre[i]] = true;
	for(int i = 0; i < m; ++i){
		int a, b, an;
		scanf("%d%d", &a, &b);
		for(int j = 0; j < n; ++j){
			an = pre[j];
			if((an > a && an <= b) || (an <= a && an > b) || an == a || an == b) break;
		}
		if(!mp[a] && !mp[b])	printf("ERROR: %d and %d are not found.\n", a, b);
		else if(!mp[a] || !mp[b])	printf("ERROR: %d is not found.\n", !mp[a]? a : b);
		else if(an == a || an == b)	printf("%d is an ancestor of %d.\n", an, an == a? b : a);
		else printf("LCA of %d and %d is %d.\n", a, b, an);
	}
	return 0;
}

代码参考：https://blog.csdn.net/liuchuo/article/details/79618849

标签

#PAT