leetcode原题目
两种方式解答:
1.双指针解决:
// 双指针
var sortedSquares = function(nums) {
let begin = 0;
let end = nums.length - 1;
let array = [];
let pos = nums.length - 1;
while(begin <= end) {
if(nums[begin] * nums[begin] > nums[end] * nums[end]) {
array[pos] = nums[begin] * nums[begin];
begin++;
}else {
array[pos] = nums[end] * nums[end];
end--;
}
pos--;
}
return array;
};
2.暴力AC:
var sortedSquares = function(nums) {
let array = nums.map((item) =>
Math.pow(item,2)
)
array.sort((a,b) => a-b);
return array;
};