LeetCode238. Product of Array Except Self解题

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        int totalSum=1,resulti,totalSum2=1;
        vector<int> result;
        int length=nums.size();
        //count total
        for(int i=0;i//calculate each
        for(int i=0;iif(nums[i]!=0){
                result.push_back(totalSum/nums[i]);
            }else{//nums[i]==0
                for(int j=0;jif(j==i)
                        continue;
                    totalSum2*=nums[j];
                }
                 result.push_back(totalSum2);
            }
        }
        return result;
    }
};

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        int left = 1, right = 1, n = nums.size();
        vector<int> res(n, 1);

        for (int i = 0; i < n; i++) {
            res[i] *= left;
            left *= nums[i]; // i's left part
            res[n - i - 1] *= right;
            right *= nums[n - i - 1]; // i's right part
        }
        return res;
    }
};