-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path66_Construct_Array.cpp
More file actions
68 lines (49 loc) · 1.38 KB
/
66_Construct_Array.cpp
File metadata and controls
68 lines (49 loc) · 1.38 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
//
// Created by mark on 2019/7/30.
// Copyright © 2019年 mark. All rights reserved.
//
/*
说明:
1. 问题:66. 构建乘积数组。给定一个数组A,返回一个数组B,数组B中的元素B[i]是除了A[i]之外的连乘值
2. 思路:具体参考原书:定义 C[i] = C[i-1] * A[i-1],自上而下计算所有A[i];定义 D[i] = D[i+1] * A[i+1] 自下而上计算 B[i] = C[i] * D[i]
*/
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <assert.h>
#include <cstdio>
#include <fstream>
#include <map>
#include <set>
#include <deque>
#include <algorithm>
#include <list>
using namespace std;
vector<int> multiply(vector<int> &arr)
{
if(arr.size() < 1)
throw "没有数据!";
vector<int> res(arr.size());
res[0] = 1;
for(int i = 1; i < arr.size(); i++) // 自前向后计算C[i] = C[i-1] * A[i-1]
res[i] = res[i - 1] * arr[i - 1];
int temp = 1;
for(int i = arr.size() - 2; i >= 0; i--) // 自后向前计算 D[i] = C[i+1] * A[i+1]
{
temp *= arr[i + 1];
res[i] *= temp;
}
return res;
}
int main()
{
vector<int> arr{1,2,3,4,5};
vector<int> res = multiply(arr);
for(vector<int>::iterator iter = res.begin(); iter != res.end(); iter++)
cout << *iter << " ";
cout << endl;
return 0;
}