c_cpp leetcode_238.cpp

Posted 2021-05-14

vector<int> productExceptSelf(vector<int>& nums) {
        
        vector<int> res(nums.size(),1);
        int r=1;//maintain diff right product because ret[i] is not 1 but has a prev value;
        for(int i=1;i<nums.size();i++)
        	res[i]=res[i-1]*nums[i-1];
        for (int i = nums.size()-2; i >=0 ; --i)
            r*=nums[i+1],res[i]*=r;
        
        return res;
    }