题目描述：
LeetCode 329. Longest Increasing Path in a Matrix
Given an integer matrix, find the length of the longest increasing path.
From each cell, you can either move to four directions: left, right, up or down. You may NOT move ...
归档 2016
[LeetCode]Longest Increasing Path in a Matrix
[LeetCode]Odd Even Linked List
作者是
发布于
在
LeetCode.
题目描述：
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.
You should try to do it in ...
[LeetCode]Count of Range Sum
作者是
发布于
在
LeetCode.
题目描述：
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 ≤ ...
[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 ...