0977-squares-of-a-sorted-array.js

/**
 * 977. Squares of a Sorted Array
 * https://leetcode.com/problems/squares-of-a-sorted-array/
 * Difficulty: Easy
 *
 * 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.
 */

/**
 * @param {number[]} A
 * @return {number[]}
 */
var sortedSquares = function(A) {
  return A.map(n => Math.pow(n, 2)).sort((a, b) => a - b);
};

// O(n) without sorting
// var sortedSquares = function(nums) {
//   let n = nums.length;
//   let result = new Array(n);
//   let left = 0, right = n - 1;

//   for (let i = n - 1; i >= 0; i--) {
//     if (Math.abs(nums[left]) > Math.abs(nums[right])) {
//       result[i] = nums[left] * nums[left];
//       left++;
//     } else {
//       result[i] = nums[right] * nums[right];
//       right--;
//     }
//   }

//   return result;
// };