Given a list of non negative integers, arrange them such that they form the largest number.
For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.
Note: The result may be ve...
分类：
其他好文 时间：
2015-01-14 09:47:36
阅读次数：
99
Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,
return 1->4->3->2->5->NULL.
Note:
Given m, n satisfy the...
分类：
其他好文 时间：
2015-01-13 19:52:19
阅读次数：
124
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
1
2
/
3
return [1,3,2].
Note: Recursive solutio...
分类：
其他好文 时间：
2015-01-13 19:51:27
阅读次数：
142
Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from ...
分类：
其他好文 时间：
2015-01-13 17:51:17
阅读次数：
180
Given a collection of integers that might contain duplicates, S, return all possible subsets.
Note:
Elements in a subset must be in non-descending order.The solution set must not contain dupli...
分类：
其他好文 时间：
2015-01-13 17:45:51
阅读次数：
139
【题目】
Given a list of non negative integers, arrange them such that they form the largest number.
For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.
Note: The result...
分类：
其他好文 时间：
2015-01-13 16:04:41
阅读次数：
147
You may either install or download a plugin. Note that for install, the web server needs to have access privileges to the /plugins folder on the file ...
分类：
其他好文 时间：
2015-01-13 15:46:03
阅读次数：
142
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.
Calling next() will
return the next smallest number in the BST.
Note: next() a...
分类：
编程语言 时间：
2015-01-13 14:25:39
阅读次数：
240
https://oj.leetcode.com/problems/single-number/Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your al...
分类：
其他好文 时间：
2015-01-13 14:16:55
阅读次数：
141
Given a set of distinct integers, S, return all possible subsets.
Note:
Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.
For exa...
分类：
其他好文 时间：
2015-01-13 10:35:09
阅读次数：
181
