modify code

Author: algorithmzuo

src/topinterviewquestions/Problem_0238_ProductOfArrayExceptSelf.java

@@ -29,5 +29,21 @@ public int[] productExceptSelf(int[] nums) {
 		}
 		return nums;
 	}
+	
+	public int[] productExceptSelf2(int[] nums) {
+		int n = nums.length;
+		int[] ans = new int[n];
+		ans[0] = nums[0];
+		for (int i = 1; i < n; i++) {
+			ans[i] = ans[i - 1] * nums[i];
+		}
+		int right = 1;
+		for (int i = n - 1; i > 0; i--) {
+			ans[i] = ans[i - 1] * right;
+			right *= nums[i];
+		}
+		ans[0] = right;
+		return ans;
+	}
 
 }