题目描述：
LeetCode 513. Find Left Most Element
Given a binary tree, find the leftmost value in the last row of the tree.
Example 1:
Input:
2
/ \
1 3
Output:
1
Example 2:
Input:
1
/ \
2 3 ...
归档 2017
[LeetCode]Find Left Most Element
[LeetCode]Base 7
作者是
发布于
在
LeetCode.
题目描述：
Given an integer, return its base 7 string representation.
Example 1:
Input: 100 Output: "202"
Example 2:
Input: -7 Output: "-10"
Note: The input will be in range of [-1e7, 1e7].
题目大意：
给定一个整数，返回其7进制的字符串。
注意： 输入在范围[-1e7, ...
LeetCode Weekly Contest 18b解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 18b是LeetCode举办的第二十三场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-18b/
题解列表：
LeetCode 496. Next Greater Element I
[LeetCode]Diagonal Traverse
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 498. Diagonal Traverse
Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order.
Example 1:
Input: [ [ 1, 2, 3 ], [ 4, 5, 6 ], ...
[LeetCode]Next Greater Element II
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 503. Next Greater Element II
Given a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. The Next Greater Number of a number ...