diff --git a/problems/0053.最大子序和（动态规划）.md b/problems/0053.最大子序和（动态规划）.md
index c7d1b2fd..bd490912 100644
--- a/problems/0053.最大子序和（动态规划）.md
+++ b/problems/0053.最大子序和（动态规划）.md
@@ -139,8 +139,6 @@ Python：
 ```python
 class Solution:
     def maxSubArray(self, nums: List[int]) -> int:
-        if len(nums) == 0:
-            return 0
         dp = [0] * len(nums)
         dp[0] = nums[0]
         result = dp[0]