Zarlove的博客

Leetcode 53 Maximum Subarray题目原文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,1,-5,4], the

Leetcode 321 Burst Balloons题目原文Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by arraynums. You are asked to burst all the balloons. If the