-
Notifications
You must be signed in to change notification settings - Fork 229
/
Copy path1664-ways-to-make-a-fair-array.js
45 lines (43 loc) · 1.05 KB
/
1664-ways-to-make-a-fair-array.js
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
/**
* @param {number[]} nums
* @return {number}
*/
const waysToMakeFair = function(nums) {
const n = nums.length, right = Array(2).fill(0), left = Array(2).fill(0)
let res = 0
for(let i = 0; i < n; i++) right[i % 2] += nums[i]
for(let i = 0; i < n; i++) {
right[i % 2] -= nums[i]
if(left[0] + right[1] === left[1] + right[0]) res++
left[i % 2] += nums[i]
}
return res
};
// another
/**
* @param {number[]} nums
* @return {number}
*/
const waysToMakeFair = function (nums) {
const n = nums.length
const preOddSum = new Array(n + 1).fill(0)
const preEvenSum = new Array(n + 1).fill(0)
for (let i = 0; i < n; i++) {
if (i % 2 === 0) {
preEvenSum[i + 1] = nums[i] + preEvenSum[i]
preOddSum[i + 1] = preOddSum[i]
} else {
preOddSum[i + 1] = nums[i] + preOddSum[i]
preEvenSum[i + 1] = preEvenSum[i]
}
}
let ret = 0
for (let i = 0; i < n; i++) {
if (
preEvenSum[i] + preOddSum[n] - preOddSum[i + 1] ===
preOddSum[i] + preEvenSum[n] - preEvenSum[i + 1]
)
ret++
}
return ret
}