977. Squares of a Sorted Array(Leetcode每日一题-2020.10.16)

Problem

Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.

Note:

  • 1 <= A.length <= 10000
  • -10000 <= A[i] <= 10000
  • A is sorted in non-decreasing order.

Example1

Input: [-4,-1,0,3,10]
Output: [0,1,9,16,100]

Example2

Input: [-4,-1,0,3,10]
Output: [0,1,9,16,100]

Solution

class Solution {
public:
    vector<int> sortedSquares(vector<int>& A) {
        if(A.empty())
            return {};
        int i = 0;
        int j = A.size() -1;

        vector<int> ret;
        while(i<=j)
        {
            if(abs(A[i]) <= abs(A[j]))
            {
                ret.push_back(A[j] * A[j]);
                --j;
            }
            else
            {
                ret.push_back(A[i] * A[i]);
                ++i;
            }
        }

        reverse(ret.begin(),ret.end());

        return ret;

    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值