leetcode-977

双指针法

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {
        int k = nums.size() - 1;
        vector<int> result(nums.size(),0);
        for(int i=0,j=k;i<=j;)
        {
            if(nums[i] * nums[i] >= nums[j] * nums[j]){
                result[k--] = nums[i] * nums[i];
                i++;
            }   
            else{
                result[k--] = nums[j] * nums[j];
                j--;
            }
        }
        return result;

    }
};