diff --git a/problems/0053.最大子序和（动态规划）.md b/problems/0053.最大子序和（动态规划）.md
index 00f3eb84..23d23400 100644
--- a/problems/0053.最大子序和（动态规划）.md
+++ b/problems/0053.最大子序和（动态规划）.md
@@ -120,6 +120,20 @@ Java：
         return res;
     }
 ```
+```Java
+//因为dp[i]的递推公式只与前一个值有关，所以可以用一个变量代替dp数组，空间复杂度为O(1)
+class Solution {
+    public int maxSubArray(int[] nums) {
+        int res = nums[0];
+        int pre = nums[0];
+        for(int i = 1; i < nums.length; i++) {
+            pre = Math.max(pre + nums[i], nums[i]);
+            res = Math.max(res, pre);
+        }
+        return res;
+    }
+}
+```
 
 Python：
 ```python