代码:
class Solution {
public int[] productExceptSelf(int[] nums) {
int n = nums.length;
int[] res = new int[n];
int product = 1;
int zerocnt = 0;
for(int i=0;i<n;i++){
if(nums[i]==0){
zerocnt++;
continue;
}
product *= nums[i];
}
if(zerocnt==0){
for(int i=0;i<n;i++){
res[i] = product / nums[i];
}
}else if(zerocnt==1){
for(int i=0;i<n;i++){
if(nums[i]==0){
res[i]=product;
}else{
res[i]=0;
}
}
}else{
for(int i=0;i<n;i++){
res[i] = 0;
}
}
return res;
}
}