-
Notifications
You must be signed in to change notification settings - Fork 0
/
max_sum_subarray.rs
76 lines (57 loc) · 1.26 KB
/
max_sum_subarray.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
/*
---
difficulty:
site: medium
perceived: hard
url: https://leetcode.com/problems/maximum-subarray
time_complexity: O(n)
space_complexity: O(1)
categories: [dp, sliding_window]
resources:
- https://www.youtube.com/watch?v=5WZl3MMT0Eg
---
*/
use std::cmp::max;
pub fn max_sub_array(nums: Vec<i32>) -> i32 {
let mut sum = nums[0];
let mut max_sum = sum;
for num in &nums[1..] {
sum = max(*num, sum+num);
max_sum = max(max_sum, sum);
}
max_sum
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_1() {
let nums = vec![1];
let actual = max_sub_array(nums);
assert_eq!(actual, 1);
}
#[test]
fn test_2() {
let nums = vec![-1];
let actual = max_sub_array(nums);
assert_eq!(actual, -1);
}
#[test]
fn test_3() {
let nums = vec![5, 4, -1, 7, 8];
let actual = max_sub_array(nums);
assert_eq!(actual, 23);
}
#[test]
fn test_4() {
let nums = vec![-2, 1, -3, 4, -1, 2, 1, -5, 4];
let actual = max_sub_array(nums);
assert_eq!(actual, 6);
}
#[test]
fn test_5() {
let nums = vec![-2, -1];
let actual = max_sub_array(nums);
assert_eq!(actual, -1);
}
}