MyLeetcode/cpp_solutions/2321.cpp at main · Kaminyou/MyLeetcode · GitHub

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
class Solution {
public:
    int maximumsSplicedArray(vector<int>& nums1, vector<int>& nums2) {
        int n = nums1.size();
        long long nums1Sum = 0;
        long long nums2Sum = 0;
        for (auto& num : nums1) nums1Sum += num;
        for (auto& num : nums2) nums2Sum += num;

        long long res = 0;
        res = max(res, nums1Sum);
        res = max(res, nums2Sum);
        // nums1 -> nums2 // move max diff of nums1 - nums2
        vector<long long> diff(n, 0);
        for (int i = 0; i < n; ++i) {
            diff[i] = nums1[i] - nums2[i];
        }
        long long maxDiff = 0;
        long long currDiff = 0;
        for (int i = 0; i < n; ++i) {
            currDiff += diff[i];
            if (currDiff < 0) {
                currDiff = 0;
            }
            maxDiff = max(maxDiff, currDiff);
        }
        if (maxDiff > 0) {
            res = max(res, nums2Sum + maxDiff);
        }

        // nums2 -> nums1
        vector<long long> revDiff(n, 0);
        for (int i = 0; i < n; ++i) {
            revDiff[i] = nums2[i] - nums1[i];
        }
        maxDiff = 0;
        currDiff = 0;
        for (int i = 0; i < n; ++i) {
            currDiff += revDiff[i];
            if (currDiff < 0) {
                currDiff = 0;
            }
            maxDiff = max(maxDiff, currDiff);
        }
        if (maxDiff > 0) {
            res = max(res, nums1Sum + maxDiff);
        }
        return (int)res;
    }
};