做不来,我做中等题基本上都是没有思路,这里需要先遍历祖先节点,那必然用先序遍历,这题还是官方题解容易理解,第二火的题解反而把我弄得脑袋昏昏的。 class Solution { TreeNode ans; public TreeNode lowestCommonAnce…
激情写逆向
5.0
origin [0xC3, 0xC2, 0xDF, 0xC7, 0xC4, 0x00
]
result ""
for i in range(5):origin[i] origin [i] ^ 0xB7result chr(origin[i])print(result)5.1
origin [0xa3, 0xb5, 0xb1, 0xb4, 0xa1
]
result ""
for i in range(5):origin[i]…