-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproduct_of_array_except_self.rs
More file actions
76 lines (63 loc) · 1.99 KB
/
product_of_array_except_self.rs
File metadata and controls
76 lines (63 loc) · 1.99 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
67
68
69
70
71
72
73
74
75
76
pub struct Solution;
impl Solution {
pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
let mut result = vec![0; nums.len()];
let mut prefix = 1;
for x in 0..nums.len() {
result[x] = prefix;
prefix *= nums[x];
}
let mut postfix = 1;
for y in (0..nums.len()).rev() {
result[y] *= postfix;
postfix *= nums[y];
}
result
}
pub fn product_except_self_on(nums: Vec<i32>) -> Vec<i32> {
let mut result = vec![0; nums.len()];
let mut left_result = vec![0; nums.len()];
for x in 1..nums.len() {
if x == 1 {
left_result[x] = nums[x - 1];
} else {
left_result[x] = nums[x - 1] * left_result[x - 1];
}
}
let mut right_result = vec![0; nums.len()];
for y in (0..nums.len() - 1).rev() {
if y == nums.len() - 2 {
right_result[y] = nums[y + 1];
} else {
right_result[y] = nums[y + 1] * right_result[y + 1];
}
}
for z in 0..nums.len() {
if z == 0 {
result[0] = right_result[0];
} else if z == nums.len() - 1 {
result[z] = left_result[z];
} else {
result[z] = right_result[z] * left_result[z];
}
}
result
}
pub fn product_except_self_on2(nums: Vec<i32>) -> Vec<i32> {
let mut result = vec![0; nums.len()];
for (x, res) in result.iter_mut().enumerate().take(nums.len()) {
let mut product = 0;
let mut init = false;
for (y, _) in nums.iter().enumerate() {
if x != y && !init {
init = true;
product = nums[y];
} else if x != y && init {
product *= nums[y];
}
}
*res = product;
}
result
}
}