summer_zhou

摘要： Q: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 contiguous subarray[4,−1,2,1]has the largest sum =6.找到连续的子数组，使得和最大。A: 典型的动态规划。f(i)：以i结尾的子数组最大和. 定义成1~i之间最大和，是不对的，因为题目要求连续的最大子数组。f(i) = f(i 阅读全文