leeocode 977 有序数组的平方

class Solution {

public:

    vector<int> sortedSquares(vector<int>& nums) {

            vector<int> arr(nums.size(),0);

            int left = 0;

            int i = nums.size()-1;

            int right =nums.size()-1; 

            while(left<=right){

                if(abs(nums[left])<abs(nums[right])){

                    arr[i--]  = pow(nums[right--],2);

                }else{

                    arr[i--]=pow(nums[left++],2);

                }

            }

            return arr;

    }

};