update: 53

Author: hijiangtao

README.md

@@ -40,7 +40,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 46  | [Permutations](https://leetcode.com/problems/permutations/)                                                                                     | [JavaScript](./src/permutations/res.js)                                                                           | Medium     |
 | 48  | [Rotate Image](https://leetcode.com/problems/rotate-image/)                                                                                     | [JavaScript](./src/rotate-image/res.js)                                                                           | Medium     |
 | 49  | [Group Anagrams](https://leetcode.com/problems/anagrams/)                                                                                       | [JavaScript](./src/anagrams/res.js)                                                                               | Medium     |
-| 53  | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)                                                                             | [JavaScript](./src/maximum-subarray/res.js)                                                                       | Easy       |
+| 53  | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)                                                                             | [JavaScript](./src/maximum-subarray/res.js) · [TypeScript](./src/maximum-subarray/res.ts)                         | Easy       |
 | 54  | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)                                                                                   | [JavaScript](./src/spiral-matrix/res.js)                                                                          | Medium     |
 | 55  | [Jump Game](https://leetcode.com/problems/jump-game/) <sup>*</sup>                                                                              | [JavaScript](./src/jump-game/res.js)                                                                              | Medium     |
 | 56  | [Merge Intervals](https://leetcode.com/problems/merge-intervals/)                                                                               | [JavaScript](./src/merge-intervals/res.js)                                                                        | Medium     |

src/maximum-subarray/res.ts

@@ -0,0 +1,55 @@
+function maxSubArray(nums: number[]): number {
+    if (nums.length === 0) {
+        return 0;
+    }
+
+    if (nums.length === 1) {
+        return nums[0];
+    }
+
+    const maxI = [nums[0]];
+    nums.forEach((num, i) => {
+       if (!i) {
+           return ;
+       }
+
+       maxI[i] = Math.max(maxI[i-1]+num, num);
+    })
+
+    return Math.max(...maxI);
+};
+
+function Status(lSum: number, rSum: number, mSum: number, iSum: number) {
+    return {
+        lSum,
+        rSum,
+        mSum,
+        iSum,
+    };
+}
+
+function getSum(nums: number[], start: number, end: number) {
+    if (start === end) {
+        return Status(nums[start], nums[start], nums[start], nums[start]);
+    }
+
+    const mIndex = Math.floor((start + end) / 2);
+    const leftSum = getSum(nums, start, mIndex);
+    const rightSum = getSum(nums, mIndex+1, end);
+
+    return Status(
+        Math.max(leftSum.lSum, leftSum.iSum + rightSum.lSum),
+        Math.max(rightSum.rSum, rightSum.iSum + leftSum.rSum),
+        Math.max(leftSum.mSum, rightSum.mSum, leftSum.rSum + rightSum.lSum),
+        leftSum.iSum+rightSum.iSum
+    )
+
+}
+
+/**
+ * 线段树
+ * @param nums
+ */
+function maxSubArray2(nums: number[]): number {
+    return getSum(nums, 0, nums.length-1).mSum;
+};

src/minimum-depth-of-binary-tree/res.ts

@@ -16,7 +16,7 @@ function minDepth(root: TreeNode | null): number {
     if (!root) {
         return 0;
     }
-    
+
     if (!root.left && !root.right) {
         return 1;
     }