add solution 053[js]

Author: limbowandering

solution/053.Maximum Subarray/Solution.js

@@ -0,0 +1,9 @@
+const maxSubArray = function(nums){
+  if(nums.length === 0) return 0;
+  let ans = nums[0], tmp = nums[0];
+  for(let i = 1; i < nums.length; i++){
+    tmp = Math.max(tmp+nums[i], nums[i]);
+    ans = Math.max(ans,tmp);
+  }
+  return ans;
+}