array - 2 pointers O(n) O(n)

Author: lukeist

…6w40h/w1-41-!!1-SquaresOfASortedArray.js …6w40h/w1-41-!!2-SquaresOfASortedArray.js_leetcode_from-blind75-26w40h/w1-41-!!1-SquaresOfASortedArray.js renamed to _leetcode_from-blind75-26w40h/w1-41-!!2-SquaresOfASortedArray.js _leetcode_from-blind75-26w40h/w1-41-!!1-SquaresOfASortedArray.js renamed to _leetcode_from-blind75-26w40h/w1-41-!!2-SquaresOfASortedArray.js

@@ -0,0 +1,30 @@
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+
+// p: array;
+// r: array;
+//
+// e: [-4,-1,0,3,10 ]
+//         i
+//    [16, 1,0,9,100]
+//             j
+var sortedSquares = function (nums) {
+  const result = [];
+  let i = 0,
+    j = nums.length - 1;
+
+  while (i <= j) {
+    const n = nums[i] * nums[i];
+    const m = nums[j] * nums[j];
+    if (n < m) {
+      result.push(m);
+      j--;
+    } else {
+      result.push(n);
+      i++;
+    }
+  }
+  return result.reverse();
+};