leetcode
tctjx
这个作者很懒,什么都没留下…
展开
-
Leetcode 238. Product of Array Except Self
原题: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原创 2016-05-15 20:55:04 · 209 阅读 · 0 评论 -
leetcode 342 Power of four
原题: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原创 2016-05-07 14:40:54 · 224 阅读 · 0 评论 -
Leetcode 326. Power of Three
原题: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的最大次幂,原创 2016-05-19 14:15:39 · 210 阅读 · 0 评论