摘要:
You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following defin 阅读全文
posted @ 2020-10-26 23:34
苗妙苗
阅读(89)
评论(0)
推荐(0)
摘要:
思路:就是把gcd拆一下,因为如果GCD可以,这些数就也可以3,6 gcd = n = 3 1/3 没了,0 += 2 GCD辗转相除法:b一开始是除数,后来是余数。余数为0就行了 16 4 4,4 4,0 所以返回a = 4 https://www.geeksforgeeks.org/common 阅读全文
posted @ 2020-10-26 10:19
苗妙苗
阅读(91)
评论(0)
推荐(0)