Leetcode_DP_53_MaximumSubarray

Description

Thinking

State transformation equation

• dp[i] = max{num[i], dp[i-1]+dp[i-1]}

Code

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        
        int maxSub = nums[0];
        
        if (nums.size() != 0) {
            int* dp = new int[nums.size()];
            dp[0] = nums[0];
            
            for (int i=1; i<nums.size(); i++) {
                dp[i] = max(nums[i], dp[i-1]+nums[i]);
            }
            
            for (int i=0; i<nums.size(); i++) {
            if(maxSub < dp[i])
                maxSub = dp[i];
            }
        }
        
        return maxSub;
    }
};