0053-maximum-subarray.md Fixed Java solution.

gazeldx · gazeldx · commit 1cdef4964652 · 2024-11-26T14:05:56.000+08:00
diff --git a/0053-maximum-subarray.md b/0053-maximum-subarray.md
@@ -47,22 +47,6 @@ dp   = [-2, 1, -2, 4,  3, 5, 6,  1, 5]
 * Time: `O(n)`.
 * Space: `O(n)`.
 
-## Java
-
-```java
-class Solution {
-    int[] dp = nums.clone();
-    int result = dp[0];
-
-    for (int i = 1; i < dp.length; i++) {
-        dp[i] = Math.max(nums[i], dp[i - 1] + nums[i]);
-        if (dp[i] > result) result = dp[i];
-    }
-
-    return result; // or 'return Arrays.stream(dp).max().getAsInt();'
-}
-```
-
 ## Python
 ```python
 class Solution:
@@ -91,6 +75,23 @@ public:
 };
 ```
 
+## Java
+```java
+class Solution {
+    public int maxSubArray(int[] nums) {
+        int[] dp = nums.clone();
+        int result = dp[0];
+        
+        for (int i = 1; i < dp.length; i++) {
+            dp[i] = Math.max(nums[i], dp[i - 1] + nums[i]);
+            if (dp[i] > result) result = dp[i];
+        }
+
+        return result; // or 'return Arrays.stream(dp).max().getAsInt();'
+    }
+}
+```
+
 ## C#
 ```c#
 public class Solution {
diff --git a/0583-delete-operation-for-two-strings.md b/0583-delete-operation-for-two-strings.md
@@ -38,7 +38,7 @@ After initialized, the 'dp' array would be:
 # e 2 0 0 0
 # a 3 0 0 0
 ```
-   * `dp[0][j] = j`, because `dp[0]` represents the empty string, and the number of steps is just the number of chars to be deleted
+   * `dp[0][j] = j`, because `dp[0]` represents the empty string, and the number of steps is just the number of chars to be deleted.
    * `dp[i][0] = i`, the reason is the same as previous line, yet in vertical direction.
 3. Determine the `dp` array's recurrence formula
 ```
