leetcode-java-238. Product of Array Except Self

public class Solution {
public int[] productExceptSelf(int[] nums) {
int len = nums.length,
total = nums[0],
flag = 0,
i = 1;

int[] result = new int[len];

for(;i < len;i++) {
if(nums[i] == 0) {
flag++;
if(flag >= 2) {
return result;
}
}
if(nums[i] != 0) {
total = total * nums[i];
}
}

for(i = 0;i < len;i++) {
if(nums[i] != 0 && flag == 1) {
result[i] = 0;
} else if(nums[i] != 0 && flag == 0) {
result[i] = total/nums[i];
} else{
result[i] = total;
}
}

return result;
}
}