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;
}
};