refactor 360

fishercoder1534 · fishercoder1534 · commit c62508b5fec4 · 2020-06-10T11:54:14.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_360.java b/src/main/java/com/fishercoder/solutions/_360.java
@@ -2,27 +2,6 @@
 
 import java.util.Arrays;
 
-/**
- * 360. Sort Transformed Array
- *
- * Given a sorted array of integers nums and integer values a, b and c. Apply a function of the form f(x) = ax2 + bx + c to each element x in the array.
-
- The returned array must be in sorted order.
-
- Expected time complexity: O(n)
-
- Example:
- nums = [-4, -2, 2, 4], a = 1, b = 3, c = 5,
-
- Result: [3, 9, 15, 33]
-
- nums = [-4, -2, 2, 4], a = -1, b = 3, c = 5
-
- Result: [-23, -5, 1, 7]
-
- Credits:
- Special thanks to @elmirap for adding this problem and creating all test cases.
- */
 public class _360 {
 
     public static class Solution1 {
@@ -37,12 +16,12 @@ public int[] sortTransformedArray(int[] nums, int a, int b, int c) {
             while (i <= j) {
                 if (a >= 0) {
                     sorted[index--] =
-                        function(nums[i], a, b, c) >= function(nums[j], a, b, c) ? function(
-                            nums[i++], a, b, c) : function(nums[j--], a, b, c);
+                            function(nums[i], a, b, c) >= function(nums[j], a, b, c) ? function(
+                                    nums[i++], a, b, c) : function(nums[j--], a, b, c);
                 } else {
                     sorted[index++] =
-                        function(nums[i], a, b, c) >= function(nums[j], a, b, c) ? function(
-                            nums[j--], a, b, c) : function(nums[i++], a, b, c);
+                            function(nums[i], a, b, c) >= function(nums[j], a, b, c) ? function(
+                                    nums[j--], a, b, c) : function(nums[i++], a, b, c);
                 }
             }
             return sorted;
