LeetCode #53 Maximum Subarray 最大的子陣列

public class Solution {
    public int MaxSubArray(int[] nums) {
        int max = nums[0];
        int tmp =0;
        for(int i = 0;i<nums.Length;i++)
        {
            tmp+=nums[i];
            if(tmp>max)
            {
                max = tmp;
            }
            if(tmp<0)
            {
                tmp = 0;
            }
        }
        return max;
    }
}

class Solution {
    public int maxSubArray(int[] nums) {
        int max = nums[0];
        int tmp =0;
        for(int i = 0;i<nums.length;i++)
        {
            tmp+=nums[i];
            if(tmp>max)
            {
                max = tmp;
            }
            if(tmp<0)
            {
                tmp = 0;
            }
        }
        return max;
    }
}

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        max = nums[0]
        tmp =0
        for i in range(0,len(nums)):
            tmp+=nums[i]
            
            if(tmp>max):
                max = tmp
            
            if(tmp<0):
            
                tmp = 0
            
        return max

/**
 * @param {number[]} nums
 * @return {number}
 */
var maxSubArray = function(nums) {
    var max = nums[0];
    var tmp =0;
    for(var i = 0;i<nums.length;i++)
    {
        tmp+=nums[i];
        if(tmp>max)
        {
            max = tmp;
        }
        if(tmp<0)
        {
            tmp = 0;
        }
    }
    return max;
};