题目描述：
Given an integer array nums, return the number of range sums that lie in [lower, upper] inclusive.
Range sum S(i, j) is defined as the sum of the elements in nums between indices i and j (i ≤ ...
归档 2016年1月
[LeetCode]Count of Range Sum
[LeetCode]Power of Three
作者是
发布于
在
LeetCode.
题目描述：
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?
题目大意：
给定一个整数，编写函数判断它是否是3的幂。
进一步思考：
你可以不用循环/递归解出本题吗？
解题思路：
解法I：求对数，然后乘方，判断得数是否相等
Python代码：
class ...
[LeetCode]Sum Root to Leaf Numbers
作者是
发布于
在
LeetCode.
题目描述：
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
An example is the root-to-leaf path 1->2->3 which represents the number 123.
Find the total sum of all root-to-leaf numbers.
For example,
1 ...