程式語言 - LeetCode - C++ - 2574. Left and Right Sum Differences



題目:


解答:

class Solution {
public:
    vector<int> leftRightDifference(vector<int>& nums) {
        int n = nums.size();
        vector<int> ans(n, 0);
        int l = 0;
        int r = 0;

        for (int i = 1; i <= n; ++i) {
            ans[i - 1] = l;
            l += nums[i - 1];
        }

        for (int i = n - 1; i >= 0; --i) {
            ans[i] = abs(ans[i] - r);
            r += nums[i];
        }

        return ans;
    }
};