题目：Remove Duplicates from Sorted ListGiven a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2...
分类：
其他好文 时间：
2014-07-10 14:29:45
阅读次数：
259
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.方法一：最先想到的就是递归，注...
分类：
其他好文 时间：
2014-07-10 09:58:40
阅读次数：
224
题目
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
For example,
[1,1,2] have the following unique permutations:
[1,1,2], [1,2,1],
...
分类：
其他好文 时间：
2014-06-27 23:53:21
阅读次数：
290
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.
分类：
其他好文 时间：
2014-06-27 12:30:03
阅读次数：
200
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
分类：
其他好文 时间：
2014-06-27 11:47:58
阅读次数：
166
Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the...
分类：
其他好文 时间：
2014-06-26 07:09:01
阅读次数：
213
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 duplica...
分类：
其他好文 时间：
2014-06-24 20:58:32
阅读次数：
230
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
For example,
Given 1->2->3->3->4->4->5, return 1->2->5.
Given 1->1-...
分类：
其他好文 时间：
2014-06-22 22:57:49
阅读次数：
347
Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3...
分类：
其他好文 时间：
2014-06-21 07:30:11
阅读次数：
157
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for...
分类：
其他好文 时间：
2014-06-20 21:48:33
阅读次数：
254
