代码挑战: 最大子数组 #C++
【摘要】 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.方案：
class Solution
{
public:
int maxSubArray(vector<int> &nums)
{
int result = nums[0];
int temp = nums[0];
for (int i = 1; i < nums.size(); i++)
{
temp = max(nums[i], temp + nums[i]);
result = max(result, temp);
}
return result;
}
};
测试案例：
TEST_METHOD(TestMethod1) {
Solution solution;
int numsArray[] = { -2, -3, 4, -1, -2, 1, 5, -3 };
vector<int> nums;
nums.insert(nums.begin(), std::begin(numsArray), std::end(numsArray));
Assert::AreEqual(7, solution.maxSubArray(nums));
} // namespace UnitTest1
TEST_METHOD(TestMethod2)
{
int numsArray[] = { -2, 1, -3, 4, -1, 2, 1, -5, 4 };
vector<int> nums;
nums.insert(nums.begin(), std::begin(numsArray), std::end(numsArray));
Solution solution;
Assert::AreEqual(6, solution.maxSubArray(nums));
}
TEST_METHOD(TestMethod3)
{
int numsArray[] = { -2 };
vector<int> nums;
nums.insert(nums.begin(), std::begin(numsArray), std::end(numsArray));
Solution solution;
Assert::AreEqual(-2, solution.maxSubArray(nums));
}
分类：代码挑战
【版权声明】本文为华为云社区用户原创内容，转载时必须标注文章的来源（华为云社区）、文章链接、文章作者等基本信息， 否则作者和本社区有权追究责任。如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论（0）