refactor 238

fishercoder1534 · fishercoder1534 · commit 8cd013ced2c7 · 2020-05-23T08:10:46.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_238.java b/src/main/java/com/fishercoder/solutions/_238.java
@@ -1,18 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 238. Product of Array Except Self
- *
- * Given an array of n integers where n > 1, nums,
- * return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].
- * Solve it without division and in O(n).
- * For example, given [1,2,3,4], return [24,12,8,6].
-
- Follow up:
- Could you solve it with constant space complexity?
- (Note: The output array does not count as extra space for the purpose of space complexity analysis.)
- */
-
 public class _238 {
 
     public static class Solution1 {
@@ -23,7 +10,6 @@ public static class Solution1 {
          * res[i] *= right;
          * right *= nums[i];
          * that's it.
-         *
          * This could be very well illustrated with this example: [1,2,3,4]
          */
         public int[] productExceptSelf(int[] nums) {
