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

思路

乘积 = 当前数左边的乘积 * 当前数右边的乘积

代码

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        vector<int>result(nums.size(),0);
        int k = 1;
        for(int i = 0;i<nums.size();i++)
        {
            result[i] = k;
            k = k*nums[i];
        }
        k = 1;
        for(int j = nums.size()-1;j>=0;j--)
        {
            result[j] *= k;
            k = k*nums[j];
        }
         return result;
    }
};