diff --git a/README.md b/README.md
index 1d03c7a..f5d1616 100644
--- a/README.md
+++ b/README.md
@@ -232,8 +232,8 @@ LeetCode 与 LintCode 解题记录。此为个人练习仓库，代码中对重
 - [最大子序和](src/array/maximum-subarray.js)
 
   - LeetCode 53. 最大子序和 https://leetcode-cn.com/problems/maximum-subarray/
+  - LeetCode 面试题42. 连续子数组的最大和 https://leetcode-cn.com/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/
   - LintCode 41. 最大子数组 https://www.lintcode.com/problem/maximum-subarray/description
-  - LintCode 620. 最大子序列的和IV https://www.lintcode.com/problem/maximum-subarray-iv/description
 
 ## 栈
 
diff --git a/test/array/maximum-subarray.test.js b/test/array/maximum-subarray.test.js
index 85c792c..ad008df 100644
--- a/test/array/maximum-subarray.test.js
+++ b/test/array/maximum-subarray.test.js
@@ -2,5 +2,4 @@ import { maxSubArray } from '../../src/array/maximum-subarray'
 
 test('最大子序和', () => {
   expect(maxSubArray([-2, 1, -3, 4, -1, 2, 1, -5, 4])).toBe(6)
-  // expect(maxSubArray([-2, 2, -3, 4, -1, 2, 1, -5, 3])).toBe(5)
 })