题解 | #二叉树#
二叉树
https://www.nowcoder.com/practice/5b80ab166efa4551844657603227caeb
#include <stdio.h>
int ComFather (int x, int y){
if (x == 1 || y == 1){
return 1;
}
while (x != y){
if (x > y){
x = x / 2;
}else{
y = y / 2;
}
}
return x;
}
int main () {
int x, y;
while (scanf("%d%d", &x, &y) != EOF){
printf("%d\n", ComFather(x, y));
}
return 0;
}
华为HUAWEI工作强度 1372人发布