leetcode - 238. Product of Array Except Self

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        int pro(1),count(0);
        vector<int> ret(nums.size(),0);
        for(int i=0;i<nums.size();++i){
            if(nums[i])
            {
                pro*=nums[i];
            }else if(count){
                return ret;
            }else{
                count=i+1;
            }
        }
        if(count){
            ret[count-1]=pro;
            return ret;
        }
        for(int i=0;i<nums.size();++i){
            ret[i]=pro/nums[i];
        }
        return ret;
    }
};