0053-maximum-subarray.md Aligned the *.

gazeldx · gazeldx · commit 6dfa481903b8 · 2024-11-26T14:07:08.000+08:00
diff --git a/0053-maximum-subarray.md b/0053-maximum-subarray.md
@@ -37,7 +37,7 @@ nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4]
 dp   = [-2, 1, -2, 4,  3, 5, 6,  1, 5]
 ```
    * After analyzing the sample `dp` data, we can derive the `recurrence formula`:
-    * `dp[i] = max(nums[i], dp[i - 1] + nums[i])`.
+   * `dp[i] = max(nums[i], dp[i - 1] + nums[i])`.
 4. Determine the `dp` array's traversal order
     * `dp[i]` depends on `dp[i - 1]`, so we should traverse the `dp` array from left to right.
 5. Check the `dp` array's value
