动态规划 class Solution { public: int maxSubArray(vector<int>& nums) { int n=nums.size(); int out=nums[0],pre=nums[0]; for(int i=1;i<n;i++){ pre=max(nums[i],pre+nums[i]); out=max(pre,out); } return out; } };