@@ -0,0 +1,666 @@
+public class LeetCode0053 %7B%0A    public int maxSubArray(int%5B%5D nums) %7B%0A        if (nums == null %7C%7C nums.length == 0) %7B%0A            return 0;%0A        %7D%0A%0A        int dp%5B%5D = new int%5Bnums.length%5D;%0A        dp%5B0%5D = nums%5B0%5D;%0A%0A        int result = dp%5B0%5D;%0A        for (int i = 1; i %3C nums.length; i++) %7B%0A            dp%5Bi%5D = Math.max(nums%5Bi%5D, dp%5Bi - 1%5D + nums%5Bi%5D);%0A            result = Math.max(result, dp%5Bi%5D);%0A        %7D%0A        return result;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        LeetCode0053 leetcode = new LeetCode0053();%0A        int%5B%5D nums = new int%5B%5D %7B -2, 1, -3, 4, -1, 2, 1, -5, 4 %7D;%0A        System.out.println(leetcode.maxSubArray(nums));%0A    %7D%0A%7D%0A

Add LeetCode0053.java