代码挑战: 最大子数组 | javascript
【摘要】 Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4],Output: 6Explanation: ...
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.方案：
var maxSubArray = function(nums) {
let result = nums[0];
let temp = nums[0];
for (let i = 1; i < nums.length; i ++) {
temp = Math.max(nums[i], nums[i] + temp);
result = Math.max(temp, result);
}
return result;
};
测试案例：
it("test1", function () {
// 1. ARRANGE
let nums = [-2, -3, 4, -1, -2, 1, 5, -3];
// 2. ACT
var result = maxSubArray(nums);
// 3. ASSERT
expect(result).to.be.equal(7);
});
it("test2", function () {
// 1. ARRANGE
let nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4];
// 2. ACT
var result = maxSubArray(nums);
// 3. ASSERT
expect(result).to.be.equal(6);
});
it("test3", function () {
// 1. ARRANGE
let nums = [-2];
// 2. ACT
var result = maxSubArray(nums);
// 3. ASSERT
expect(result).to.be.equal(-2);
});
【版权声明】本文为华为云社区用户原创内容，转载时必须标注文章的来源（华为云社区）、文章链接、文章作者等基本信息， 否则作者和本社区有权追究责任。如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论（0）