摘要：
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 co... 阅读全文
posted @ 2014-06-21 22:17
OpenSoucre
阅读(182)
评论(0)
推荐(0)
摘要：
Given two integersnandk, return all possible combinations ofknumbers out of 1 ...n.For example,Ifn= 4 andk= 2, a solution is:[ [2,4], [3,4], [2,3],... 阅读全文
posted @ 2014-06-21 18:24
OpenSoucre
阅读(139)
评论(0)
推荐(0)
摘要：
Follow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted array A =[1,1,1,2,2,3],Your function should ret... 阅读全文
posted @ 2014-06-21 17:46
OpenSoucre
阅读(169)
评论(0)
推荐(0)
摘要：
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-... 阅读全文
posted @ 2014-06-21 16:54
OpenSoucre
阅读(163)
评论(0)
推荐(0)
摘要：
Given a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2, return1->2.Given1->1->2->3->3, retu... 阅读全文
posted @ 2014-06-21 16:34
OpenSoucre
阅读(144)
评论(0)
推荐(0)
浙公网安备 33010602011771号