#数组 #有序数据的平方 #leetcode

squares-of-a-sorted-array_977.cpp

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {
        int i = 0, j = nums.size() - 1;
        int k = 0;
        vector<int> rets(nums.size(), 0);

        for (int k = nums.size() - 1; k >=0; k--) {
            int ii = nums[i] * nums[i];
            int jj = nums[j] * nums[j];
            if ( ii > jj) {
                rets[k] = ii;
                i++;
            } else {
                rets[k] = jj;
                j--;
            }
        }
        return rets;
    }
};