摘要: 题目: 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 @ 2017-04-18 22:30 Vincent丶丶 阅读(177) 评论(0) 推荐(0) 编辑
摘要: 题目: Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2, 阅读全文
posted @ 2017-04-18 20:42 Vincent丶丶 阅读(205) 评论(0) 推荐(0) 编辑
摘要: 题目: Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums exc 阅读全文
posted @ 2017-04-18 19:46 Vincent丶丶 阅读(173) 评论(0) 推荐(0) 编辑