Problems:Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example,[1,1,2] have the following ...
分类：
其他好文 时间：
2015-06-12 16:41:11
阅读次数：
71
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类：
其他好文 时间：
2015-06-11 16:45:25
阅读次数：
88
A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array may contain multiple peaks, in that case...
分类：
其他好文 时间：
2015-06-11 13:04:38
阅读次数：
115
问题描述：You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a si...
分类：
其他好文 时间：
2015-06-10 23:52:05
阅读次数：
131
Implement a basic calculator to evaluate a simple expression string.The expression string may contain open(and closing parentheses), the plus+or minus...
分类：
其他好文 时间：
2015-06-10 06:33:42
阅读次数：
108
Basic CalculatorImplement a basic calculator to evaluate a simple expression string.The expression string may contain open(and closing parentheses), t...
分类：
编程语言 时间：
2015-06-10 00:50:16
阅读次数：
399
题目链接：http://acm.swust.edu.cn/problem/856/Time limit(ms): 1000 Memory limit(kb): 10000There are N trees in a forest. At first, each tree contain...
分类：
其他好文 时间：
2015-06-09 21:38:57
阅读次数：
121
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类：
其他好文 时间：
2015-06-09 21:35:35
阅读次数：
113
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类：
其他好文 时间：
2015-06-09 21:30:59
阅读次数：
96
You are given a non-negative integer n, its decimal representation consists of at most 100 digits
and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to r...
分类：
其他好文 时间：
2015-06-09 17:21:09
阅读次数：
133
