Add solution #53

Author: JoshCrozier

README.md

@@ -24,6 +24,7 @@
 43|[Multiply Strings](./0043-multiply-strings.js)|Medium|
 49|[Group Anagrams](./0049-group-anagrams.js)|Medium|
 50|[Pow(x, n)](./0050-powx-n.js)|Medium|
+53|[Maximum Subarray](./0053-maximum-subarray.js)|Easy|
 54|[Spiral Matrix](./0054-spiral-matrix.js)|Medium|
 58|[Length of Last Word](./0058-length-of-last-word.js)|Easy|
 66|[Plus One](./0066-plus-one.js)|Easy|

solutions/0053-maximum-subarray.js

@@ -0,0 +1,24 @@
+/**
+ * 53. Maximum Subarray
+ * https://leetcode.com/problems/maximum-subarray/
+ * Difficulty: Easy
+ *
+ * Given an integer array `nums`, find the contiguous subarray (containing at
+ * least one number) which has the largest sum and return its sum.
+ *
+ * A subarray is a contiguous part of an array.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxSubArray = function(nums) {
+  for (let i = 1; i < nums.length; i++) {
+    if (nums[i - 1] > 0) {
+      nums[i] += nums[i - 1];
+    }
+  }
+
+  return Math.max(...nums);
+};