Commit f244be0

author

guangsheng.li01

committed

Solved 0053

1 parent de3707c commit f244be0Copy full SHA for f244be0

File tree

+44

-0

lines changed

+44

-0

lines changed

Lines changed: 43 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,43 @@`
	`1`	`+/*`
	`2`	`+ * [0053] maximum-subarray`
	`3`	`+ */`
	`4`	`+`
	`5`	`+pub struct Solution {}`
	`6`	`+`
	`7`	`+// solution impl starts here`
	`8`	`+`
	`9`	`+impl Solution {`
	`10`	`+ pub fn max_sub_array(nums: Vec<i32>) -> i32 {`
	`11`	`+ let mut sum = 0;`
	`12`	`+ let mut res = nums[0];`
	`13`	`+`
	`14`	`+ for i in nums {`
	`15`	`+ if sum > 0 {`
	`16`	`+ sum += i;`
	`17`	`+ } else {`
	`18`	`+ sum = i;`
	`19`	`+ }`
	`20`	`+ res = std::cmp::max(res, sum);`
	`21`	`+ }`
	`22`	`+ res`
	`23`	`+ }`
	`24`	`+}`
	`25`	`+`
	`26`	`+// solution impl ends here`
	`27`	`+`
	`28`	`+// solution tests starts here`
	`29`	`+`
	`30`	`+#[cfg(test)]`
	`31`	`+mod tests {`
	`32`	`+ use super::*;`
	`33`	`+`
	`34`	`+ #[test]`
	`35`	`+ fn test_case0() {`
	`36`	`+ assert_eq!(`
	`37`	`+ Solution::max_sub_array(vec![-2, 1, -3, 4, -1, 2, 1, -5, 4]),`
	`38`	`+ 6`
	`39`	`+ );`
	`40`	`+ }`
	`41`	`+}`
	`42`	`+`
	`43`	`+// solution tests ends here`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,6 +10,7 @@ mod a0009_palindrome_number;`
`10`	`10`	`mod a0026_remove_duplicates_from_sorted_array;`
`11`	`11`	`mod a0027_remove_element;`
`12`	`12`	`mod a0035_search_insert_position;`
	`13`	`+mod a0053_maximum_subarray;`
`13`	`14`	`mod a0145_binary_tree_postorder_traversal;`
`14`	`15`	`mod a0172_factorial_trailing_zeroes;`
`15`	`16`	`mod a0400_nth_digit;`

Comments

(0)