摘要：
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,-1,2, 阅读全文
posted @ 2017-02-24 19:29
notesbuddy
阅读(194)
评论(0)
推荐(0)
摘要：
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
posted @ 2017-02-24 15:52
notesbuddy
阅读(158)
评论(0)
推荐(0)
摘要：
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each num 阅读全文
posted @ 2017-02-24 00:05
notesbuddy
阅读(138)
评论(0)
推荐(0)
浙公网安备 33010602011771号