Update Maximum Product of three numbers.java

varunu28 · web-flow · commit a925b55250fb · 2022-09-05T14:45:28.000-07:00
diff --git a/Easy/Maximum Product of three numbers.java b/Easy/Maximum Product of three numbers.java
@@ -2,9 +2,8 @@ class Solution {
   public int maximumProduct(int[] nums) {
     Arrays.sort(nums);
     int n = nums.length;
-    int rightSideProd = nums[n - 1] * nums[n - 2] * nums[n - 3];
-    int leftSideProd = nums[0] * nums[1] * nums[2];
-    int mixedSideProd = nums[0] * nums[1] * nums[n - 1];
-    return Math.max(rightSideProd, Math.max(leftSideProd, mixedSideProd));
+    int lastThree = nums[n - 1] * nums[n - 2] * nums[n - 3];
+    int firstTwoAndLast = nums[0] * nums[1] * nums[n - 1];
+    return Math.max(lastThree, firstTwoAndLast);
   }
 }

Original file line number	Diff line number	Diff line change
`@@ -2,9 +2,8 @@ class Solution {`
`2`	`2`	`public int maximumProduct(int[] nums) {`
`3`	`3`	`Arrays.sort(nums);`
`4`	`4`	`int n = nums.length;`
`5`		`- int rightSideProd = nums[n - 1] * nums[n - 2] * nums[n - 3];`
`6`		`- int leftSideProd = nums[0] * nums[1] * nums[2];`
`7`		`- int mixedSideProd = nums[0] * nums[1] * nums[n - 1];`
`8`		`- return Math.max(rightSideProd, Math.max(leftSideProd, mixedSideProd));`
	`5`	`+ int lastThree = nums[n - 1] * nums[n - 2] * nums[n - 3];`
	`6`	`+ int firstTwoAndLast = nums[0] * nums[1] * nums[n - 1];`
	`7`	`+ return Math.max(lastThree, firstTwoAndLast);`
`9`	`8`	`}`
`10`	`9`	`}`