代码挑战: 最大子数组 | Rust
【摘要】 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.方案：
impl Solution {
pub fn max_sub_array(nums: Vec<i32>) -> i32 {
let mut result = nums[0];
let mut temp = nums[0];
for (_pos, e) in nums.iter().enumerate() {
temp = std::cmp::max(*e, *e + temp);
result = std::cmp::max(temp, result);
}
return result;
}
}
测试案例：
#[test]
fn test1() {
let vec = vec![-2, -3, 4, -1, -2, 1, 5, -3];
let result = Solution::max_sub_array(vec);
assert_eq!(result, 7);
}
#[test]
fn test2() {
let vec = vec![-2, 1, -3, 4, -1, 2, 1, -5, 4];
let result = Solution::max_sub_array(vec);
assert_eq!(result, 6);
}
#[test]
fn test3() {
let vec = vec![-2];
let result = Solution::max_sub_array(vec);
assert_eq!(result, -2);
}
【版权声明】本文为华为云社区用户原创内容，转载时必须标注文章的来源（华为云社区）、文章链接、文章作者等基本信息， 否则作者和本社区有权追究责任。如果您发现本社区中有涉嫌抄袭的内容，欢迎发送邮件进行举报，并提供相关证据，一经查实，本社区将立刻删除涉嫌侵权内容，举报邮箱：
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论（0）