最大子序和

题源：leetcode

链接：https://leetcode-cn.com/problems/maximum-subarray/solution/zui-da-zi-xu-he-by-leetcode-solution/

一道简单的动态规划题

 1 class Solution {
 2 public:
 3     int maxSubArray(vector<int>& nums) {
 4         int size = nums.size();
 5         int temp =nums[0];
 6         int pre = 0;
 7 
 8         if(size == 1) return nums[0];
 9 
10         for(int i = 0; i<size; i++){
11             pre = max(pre+nums[i],nums[i]);
12             temp = max(temp,pre);
13         }
14         return temp;
15     }
16 };

本题还有分治法的解，后面学到了再进行添加