leetcode238. 除自身以外数组的乘积 未解决

238. 除自身以外数组的乘积

只会违规使用除法🤡

class Solution {
    public int[] productExceptSelf(int[] nums) {
        int product = 1,firstZero = -1,secondZero = -1,n = nums.length;
        for(int i = 0;i < n;++i){
            if(nums[i] == 0 && firstZero == -1)  firstZero = i;
            else if(nums[i] == 0 && firstZero != -1)  return new int[n];
            else  product *= nums[i];
        }
        int[] res = new int[n];
        if(firstZero != -1 && secondZero == -1){
            res[firstZero] = product;
            return res;
        }
        for(int i = 0;i < n;++i){
            res[i] = product / nums[i];
        }
        return res;
    }
}