C++ solution


  • 0
    L

    C++ solution:

    int maxSubArray(vector<int>& nums) {
           int n = nums.size();
           int max = nums[0];
           int sum = nums[0];
           if(n == 0 )
               return 0;
           else if(n == 1)
               return nums[0];
           else
               for(int i = 1; i < n; i++){
                    if(sum < 0){
                        sum = nums[i];
                    }else
                        sum += nums[i];
                   
                    if(sum > max)
                        max = sum;
               }
               return max;    
        }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.