977_SquaresofaSortedArray - a920604a/leetcode GitHub Wiki

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {
        for(int & a:nums) a=a*a;
        sort(nums.begin(), nums.end());
        return nums;
    }
};

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

vector<int> ret(nums.size(),0);
int l = 0,r = nums.size()-1;
int k =nums.size()-1;
while(l<=r){
    if(abs(nums[l])>=abs(nums[r])) ret[k--] =pow(nums[l++],2);
    else{
        ret[k--] = pow(nums[r--],2);
    }
}
return ret;