2015年1月27日

leetcode 【 Search in Rotated Sorted Array 】python 实现
摘要： 题目：Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).You are given a target valu... 阅读全文
posted @ 2015-01-27 22:41 承续缘 阅读(449) 评论(0) 推荐(0) 编辑
leetcode 【 Subsets II 】python 实现
摘要： 题目：Given a collection of integers that might contain duplicates,S, return all possible subsets.Note:Elements in a subset must be in non-descending ord... 阅读全文
posted @ 2015-01-27 19:48 承续缘 阅读(218) 评论(0) 推荐(0) 编辑
leetcode 【 Subsets 】python 实现
摘要： 题目：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... 阅读全文
posted @ 2015-01-27 15:55 承续缘 阅读(1165) 评论(0) 推荐(0) 编辑

导航