package siweifasan_6_5;
import org.omg.CORBA.INTERNAL;
/**
* @Description:给定一个数组A[0,1,...,n-1],请构建一个数组B[0,1,...,n-1],
* 其中B中的元素B[i]=A[0]*A[1]*...*A[i-1]*A[i+1]*...*A[n-1]。不能使用除法。
* @Author: Allen
* @Return:
*/
public class Main03 {
public static void main(String[] args) {
int[] A = {1,2,3,4,5};
Solution03 slt = new Solution03();
int[] B = slt.multiply(A);
for(int i=0; i<B.length; i++){
System.out.print(B[i]+" ");
}
}
}
class Solution03 {
public int[] multiply(int[] A) {
int[] B = new int[A.length];
B[0]=1;
for(int i=1; i < B.length; i++){
B[i]=B[i-1]*A[i-1];
}
int temp=1;
for(int j=A.length-2; j>=0; j--){
temp *= A[j+1];
B[j] *= temp;
}
return B;
}
}