Add solution #360

Author: JoshCrozier

README.md

@@ -348,6 +348,7 @@
 357|[Count Numbers with Unique Digits](./solutions/0357-count-numbers-with-unique-digits.js)|Medium|
 358|[Rearrange String k Distance Apart](./solutions/0358-rearrange-string-k-distance-apart.js)|Hard|
 359|[Logger Rate Limiter](./solutions/0359-logger-rate-limiter.js)|Easy|
+360|[Sort Transformed Array](./solutions/0360-sort-transformed-array.js)|Medium|
 363|[Max Sum of Rectangle No Larger Than K](./solutions/0363-max-sum-of-rectangle-no-larger-than-k.js)|Hard|
 365|[Water and Jug Problem](./solutions/0365-water-and-jug-problem.js)|Medium|
 367|[Valid Perfect Square](./solutions/0367-valid-perfect-square.js)|Easy|

solutions/0360-sort-transformed-array.js

@@ -0,0 +1,52 @@
+/**
+ * 360. Sort Transformed Array
+ * https://leetcode.com/problems/sort-transformed-array/
+ * Difficulty: Medium
+ *
+ * Given a sorted integer array nums and three integers a, b and c, apply a quadratic function
+ * of the form f(x) = ax2 + bx + c to each element nums[i] in the array, and return the array
+ * in a sorted order.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} a
+ * @param {number} b
+ * @param {number} c
+ * @return {number[]}
+ */
+var sortTransformedArray = function(nums, a, b, c) {
+  const result = new Array(nums.length);
+  let left = 0;
+  let right = nums.length - 1;
+  let index = a >= 0 ? nums.length - 1 : 0;
+
+  while (left <= right) {
+    const leftVal = transform(nums[left]);
+    const rightVal = transform(nums[right]);
+
+    if (a >= 0) {
+      if (leftVal > rightVal) {
+        result[index--] = leftVal;
+        left++;
+      } else {
+        result[index--] = rightVal;
+        right--;
+      }
+    } else {
+      if (leftVal < rightVal) {
+        result[index++] = leftVal;
+        left++;
+      } else {
+        result[index++] = rightVal;
+        right--;
+      }
+    }
+  }
+
+  return result;
+
+  function transform(x) {
+    return a * x * x + b * x + c;
+  }
+};