LeetCode 238. Product of Array Except Self

最新推荐文章于 2021-10-11 11:07:24 发布

ActiveCoder

最新推荐文章于 2021-10-11 11:07:24 发布

阅读量255

点赞数

分类专栏： LeetCode 题解

本文链接：https://blog.csdn.net/github_34333284/article/details/51079939

版权

LeetCode 题解专栏收录该内容

288 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <vector>
using namespace std;

// Given an array of n integers where n > 1, nums, return an array ouput 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) time.
// for example, given [1, 2, 3, 4] -> [24, 12, 8, 6]

vector<int> productArray(vector<int> array) {
    // all we need to do is to go through the array twice.
    int size = array.size();
    vector<int> forward(size, 1);
    vector<int> backward(size, 1);
    for(int i = 0; i <= size - 2; ++i) {
       forward[i+1] = forward[i]* array[i];
    }

    for(int i = size - 1; i > 0; --i) {
        backward[i-1] = backward[i] * array[i];
    }

    for(int i = 0; i < size; ++i) {
        forward[i] = forward[i] * backward[i];
    }
    return forward;
}

// test
int main(void) {
    vector<int> testArray;
    testArray.push_back(1);
    testArray.push_back(2);
    testArray.push_back(3);
    testArray.push_back(4);
    vector<int> result = productArray(testArray);
    for(int i = 0; i < result.size(); ++i) {
        cout << result[i] << endl;
        cout << endl;
    }
}