yige/js-practice
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

update: 最大子序和

Browse Source
This commit is contained in:
yi-ge 2020-05-03 19:17:22 +08:00
parent e9fd76de1b
commit c5f7255d3a
2 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -232,8 +232,8 @@ LeetCode 与 LintCode 解题记录。此为个人练习仓库，代码中对重
- [最大子序和](src/array/maximum-subarray.js) - [最大子序和](src/array/maximum-subarray.js)
- LeetCode 53. 最大子序和 https://leetcode-cn.com/problems/maximum-subarray/ - 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 41. 最大子数组 https://www.lintcode.com/problem/maximum-subarray/description
- LintCode 620. 最大子序列的和IV https://www.lintcode.com/problem/maximum-subarray-iv/description
## 栈 ## 栈

1
test/array/maximum-subarray.test.js
View File

@ -2,5 +2,4 @@ import { maxSubArray } from '../../src/array/maximum-subarray'
test('最大子序和', () => { test('最大子序和', () => {
expect(maxSubArray([-2, 1, -3, 4, -1, 2, 1, -5, 4])).toBe(6) 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)
}) })