From 7c60dee83b436e8e8a667bf9f191beced8de4fc3 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Mon, 10 Mar 2025 00:36:13 -0600 Subject: chore: move cpp and rust code to directory --- other/max_subarray.cpp | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 other/max_subarray.cpp (limited to 'other/max_subarray.cpp') diff --git a/other/max_subarray.cpp b/other/max_subarray.cpp new file mode 100644 index 0000000..7356925 --- /dev/null +++ b/other/max_subarray.cpp @@ -0,0 +1,32 @@ +#include "leetcode.h" + +class Solution { +public: + int maxSubArray(vector &nums) { + return helper(nums, 0, nums.size() - 1); + } + +private: + int helper(vector &nums, int l, int r) { + if (l > r) + return INT_MIN; + int m = l + (r - l) / 2, mL = 0, mR = 0; + int lMax = helper(nums, l, m - 1); + int rMax = helper(nums, m + 1, r); + for (int i = m - 1, sum = 0; i >= l; i--) { + sum += nums[i]; + mL = max(sum, mL); + } + for (int i = m + 1, sum = 0; i <= r; i++) { + sum += nums[i]; + mR = max(sum, mR); + } + return max(max(lMax, rMax), mL + mR + nums[m]); + } +}; + +int main() { + vector nums = {-2, 1, -3, 4, -1, 2, 1, -5, 4}; + Solution obj; + cout << obj.maxSubArray(nums); +} -- cgit v1.2.3