摘要: 题目描述: Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4 阅读全文
posted @ 2016-03-11 20:16 skycore 阅读(140) 评论(0) 推荐(0) 编辑
摘要: 题目描述: Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example,[1,1,2] have the following uni 阅读全文
posted @ 2016-03-11 19:13 skycore 阅读(142) 评论(0) 推荐(0) 编辑