add comment for 238

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/firstthousand/_238.java

@@ -3,6 +3,11 @@
 public class _238 {
 
     public static class Solution1 {
+        /**
+         * Have two arrays to help out: one array holds all the products of elements to the left of
+         * nums[i] the 2nd array holds all the products of elements to the right of nums[i[ then
+         * multiply them together.
+         */
         public int[] productExceptSelf(int[] nums) {
             int[] left = new int[nums.length];
             left[0] = 1;