LeetCode 977.Squares of a Sorted Array 做题记录

 这道题暴力破解的解法：

class Solution {
public:
    vector<int> sortedSquares(vector<int>& A) {
        vector<int> B;
        
        for (int x : A) {
            B.push_back(x * x);
        }

        sort(B.begin(), B.end());

        return B;

    }
};

后面参考答案，双指针做法，

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {
        const int n = nums.size();
        int negative = -1;

        for (int i = 0; i < n; ++i) {
            if (nums[i] <  0) negative = i;
            else break;
        }

        vector<int> ans;

        int i = negative, j = negative + 1;

        while (i >= 0 || j < n) {
            if (i < 0) {
                ans.push_back(nums[j] * nums[j]);
                ++j;
            }
            else if (j == n) {
                ans.push_back(nums[i] * nums[i]);
                --i;
            }
            else if (nums[i] * nums[i] < nums[j] * nums[j]) {
                ans.push_back(nums[i] * nums[i]);
                --i;
            }
            else {
                ans.push_back(nums[j] * nums[j]);
                ++j;
            }
        }
      
        return ans;
    }
};