Leetcode sword finger offer jz42 maximum sum of continuous subarrays

The author comes up with two kinds of questions Problem solving mode

The first solution to violence , Traversing arrays directly array Sequentially calculate a[1] Value a[1]+a[2] Value a[1]+a[2]+a[3] Value

Deduce in sequence Values of various continuous subarrays , And then in turn max Value comparison .

The second one adopts the idea of dynamic programming

class Solution {
public:
    int FindGreatestSumOfSubArray(vector<int> array) {
      int cursum=0; //cursum Is before the sequence number of the current array   Maximum value of continuous word array 
      int ret=array[0];//ret Is the first string of the current array 
     for(int i=0;i<array.size();i++) // Traversal array array
         {
         if(cursum<=0)
             cursum=array[i]; // The maximum value before the sequence number of the current array is less than zero , Then the maximum value of the current serial number will not exceed the current value 
         else
             cursum+=array[i];

           ret=max(ret,cursum);// Keep going cursum Compare the values of , Call out the big one and put it in ret;


}
      return  ret;
 
    }
};