Galactic Trade Route Optimization Solution

Explanation: Step-by-step: Given the input [3, -5, 2, -7, 4], we first initialize two variables, max_sum and current_sum, to 0. We then iterate over the array, updating current_sum to be the maximum of 0 and current_sum + nums[i]. If current_sum is greater than max_sum, we update max_sum to be current_sum. We also check if the sign of current_sum and nums[i] are different, and if so, we update max_sum to be the maximum of max_sum and current_sum. Finally, we return max_sum. In this case, the subarray [3, -5, 2, -7, 4] ends with a positive value, so we return 11.

Explanation: Step-by-step: Given the input [-8, 7, 3, -2], we first initialize two variables, max_sum and current_sum, to 0. We then iterate over the array, updating current_sum to be the maximum of 0 and current_sum + nums[i]. If current_sum is greater than max_sum, we update max_sum to be current_sum. We also check if the sign of current_sum and nums[i] are different, and if so, we update max_sum to be the maximum of max_sum and current_sum. Finally, we return max_sum. In this case, the subarray [-8, 7, 3, -2] ends with a negative value, so we return 13.