977. 有序数组的平方

vector<int> sortedSquares(vector<int>& nums) {
        vector<int> res;
        res.resize(nums.size());
        if(nums.empty()){
            return res;
        }
        int low = 0;
        int high = nums.size()-1;
        int count = nums.size()-1;
        while(low <= high ){
            if(abs(nums[low]) <= abs(nums[high])){
                res[count] = nums[high]*nums[high];
                high--;
            }else{
                res[count] = nums[low]*nums[low];
                low++;
            }
            count--;

        }
        return res;
    }

今天下班太晚了，明天把剩下的题补上