Math1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18class Solution {
public int[] productExceptSelf(int[] nums) {
int leng = nums.length;
int[] res = new int[leng];
if (leng == 0) return res;
int runningprefix = 1;
for (int i = 0; i < leng; i++) {
res[i] = runningprefix;
runningprefix *= nums[i];
}
int runningsufix = 1;
for (int i = leng - 1; i >= 0; i--) {
res[i] *= runningsufix;
runningsufix *= nums[i];
}
return res;
}
}