剑指Offer，构建乘积数组

zebinh · zebinh · commit ebe1913adf57 · 2019-12-28T22:56:52.000+08:00
diff --git a/swordoffer/MultiplySolution.java b/swordoffer/MultiplySolution.java
@@ -0,0 +1,31 @@
+/**
+ * 
+ */
+import java.util.ArrayList;
+public class MultiplySolution {
+
+
+    public int[] multiply(int[] A) {
+
+        int tmp = 1;
+        int[] L = new int[A.length];
+        for(int i = 0; i < A.length; i++) {
+            L[i] = tmp * A[i];
+            tmp = L[i];
+        }
+        tmp = 1;
+        int[] R = new int[A.length];
+        for (int i = A.length - 1; i >= 0; i --) {
+            R[i] = tmp * A[i];
+            tmp = R[i];
+        }
+
+        int[] B = new int[A.length];
+        B[0] = R[1];
+        B[A.length-1] = L[A.length-2];
+        for (int i = 1; i < A.length - 1; i++) {
+            B[i] = L[i-1] * R[i+1];
+        }
+        return B;
+    }
+}
