qq_31361913的博客

https://leetcode-cn.com/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/solution/mian-shi-ti-36-er-cha-sou-suo-shu-yu-shuang-xian-5/采用中序遍历来做。需要注意的是牛客网不需要我们把头和尾相连接。代码如下：/**public class TreeNode { int val = 0; TreeNode left = null;

https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/solution/mian-shi-ti-33-er-cha-sou-suo-shu-de-hou-xu-bian-6/代码如下：public class Solution { public boolean VerifySquenceOfBST(int [] sequence) { // Corner Case

这类题都可以用一种recursive的方法去解决，下面以342为例：首先是Base Case: 如果 num <= 0, 则num不是4的幂；如果num == 1，则num是4的幂.然后是Recursive Rule: 如果num不是4的倍数，则num不是4的幂；如果num是4的倍数，则继续检查num / 4是否为4的幂。class Solution { public boolean isPowerOfFour(int num) { if(num <= 0)

这道题就是一个简单地recursive题，唯一需要注意的点是Integer.MIN_VALUE的相反数超出了int类型能表示的最大值，所以我们需要先用long数据类型把int n 存下来，在使用取反操作。class Solution { public double myPow(double x, int n) { // -2147483648 would cause overflow because it does not // have opposite n