@@ -0,0 +1,358 @@
+public class Solution %7B%0A    public int maxSubArray(int%5B%5D nums) %7B%0A        int max_sofar = nums%5B0%5D;%0A        int max_endinghere = nums%5B0%5D;%0A        for(int i=1; i%3Cnums.length; i++) %7B%0A            max_endinghere = Math.max(max_endinghere + nums%5Bi%5D, nums%5Bi%5D);%0A            max_sofar = Math.max(max_sofar, max_endinghere);%0A        %7D%0A        return max_sofar;%0A    %7D%0A%7D%0A

Create Maximum_Subarray.java