tctjx的博客

原题： Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i]. Solve it without division

原题： Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Given num = 16, return true. Given num = 5, return false. Follow up: Could you solve it

原题： Given an integer, write a function to determine if it is a power of three. Follow up: Could you do it without using any loop / recursion? 分析： 对于类似的题可以找到一个通用的解法，即假maxPower是32位整数中，3的最大次幂，