想出来了一半 我好菜呜呜呜
java:
class Solution {
public int[] constructArr(int[] a) {
int n = a.length;
if(n == 0){
return new int[0];
}
int[] b = new int[n];
b[0] = 1;
for(int i = 1; i < a.length; i++){
b[i] = b[i - 1] * a[i - 1];
}
int tmp = 1;
for(int i = n - 2; i >= 0; i--){
tmp *= a[i + 1];
b[i] *= tmp;
}
return b;
}
}
python3:
class Solution:
def constructArr(self, a: List[int]) -> List[int]:
n = len(a)
b= [1] * n
for i in range(1,n):
b[i] = b[i - 1] * a[i - 1]
tmp = 1
for i in range(n - 2, -1, -1):
tmp *= a[i + 1]
b[i] *= tmp
return b