题目描述：
LeetCode 386. Lexicographical Numbers
Given an integer n, return 1 - n in lexicographical order.
For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].
Please optimize your algorithm to use less ...
归档 2016
[LeetCode]Lexicographical Numbers
[LeetCode]Same Tree
作者是
发布于
在
LeetCode.
题目描述：
Given two binary trees, write a function to check if they are equal or not.
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
题目大意：
给定两棵二叉树 ...
[LeetCode]Mini Parser
作者是
发布于
在
LeetCode.
题目描述：
Given a nested list of integers represented as a string, implement a parser to deserialize it.
Each element is either an integer, or a list -- whose elements may also be integers or other lists.
Note ...
[LeetCode]Shuffle an Array
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 384. Shuffle an Array
Shuffle a set of numbers without duplicates.
Example:
// Init an array with set 1, 2, and 3.
int[] nums = {1,2,3};
Solution solution = new Solution(nums);
// Shuffle the array [1,2,3] and ...
[LeetCode]Ransom Note
作者是
发布于
在
LeetCode.
题目描述：
Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines; otherwise, it will ...