diff options
-rw-r--r-- | maximum_subarray.c | 27 | ||||
-rw-r--r-- | maximum_subarray.py | 29 |
2 files changed, 56 insertions, 0 deletions
diff --git a/maximum_subarray.c b/maximum_subarray.c new file mode 100644 index 0000000..67bf727 --- /dev/null +++ b/maximum_subarray.c @@ -0,0 +1,27 @@ +// 53. Maximum Subarray +#include "leetcode.h" + +/* + * given an integer array 'nums', find the subarray with the largest sum, and + * return its sum. + */ + +int maxSubArray(int *nums, int numsSize) { + int max_sum = nums[0], curr_sum = 0; + for (int i = 0; i < numsSize; i++) { + curr_sum += nums[i]; + if (max_sum < curr_sum) + max_sum = curr_sum; + if (curr_sum < 0) + curr_sum = 0; + } + return max_sum; +} + +int main() { + int n1[] = {-2, 1, -3, 4, -1, 2, 1, -5, 4}, n2[] = {1}, + n3[] = {5, 4, -1, 7, 8}; + printf("%d\n", maxSubArray(n1, ARRAY_SIZE(n1))); // expect: 6 + printf("%d\n", maxSubArray(n2, ARRAY_SIZE(n2))); // expect: 1 + printf("%d\n", maxSubArray(n3, ARRAY_SIZE(n3))); // expect: 23 +} diff --git a/maximum_subarray.py b/maximum_subarray.py new file mode 100644 index 0000000..1edbefc --- /dev/null +++ b/maximum_subarray.py @@ -0,0 +1,29 @@ +# 53. Maximum Subarray + +""" +given an integer array 'nums', find the subarray with the largest sum, and +return its sum. +""" + + +class Solution(object): + def maxSubArray(self, nums): + """ + :type nums: List[int] + :rtype: int + """ + max_sum, curr_sum = float("-inf"), 0 + for i in nums: + curr_sum += i + if max_sum < curr_sum: + max_sum = curr_sum + if curr_sum < 0: + curr_sum = 0 + return max_sum + + +if __name__ == "__main__": + obj = Solution() + print(obj.maxSubArray(nums=[-2, 1, -3, 4, -1, 2, 1, -5, 4])) + print(obj.maxSubArray(nums=[1])) + print(obj.maxSubArray(nums=[5, 4, -1, 7, 8])) |