leetcode 238

Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Solve it without division and in O(n).

For example, given [1,2,3,4], return [24,12,8,6].

Follow up:
Could you solve it with constant space complexity? (Note: The output array does not count as extra space for the purpose of space complexity analysis.)

Subscribe to see which companies asked this question.

o(n),

思路：排除边界情况，，，size =0|1

设置左右两个数组

左数组left left[0]=1,left[i]=left[i-1]*num[i-1]

右数组right right[size-1] = 1      right[i] = right[i+1]*nums[i+1]

代码：

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