--- title: Equilibrium index id: 5987fd532b954e0f21b5d3f6 challengeType: 5 videoUrl: '' localeTitle: 均衡指数 --- ## Description

序列的平衡指数是序列的索引,使得较低指数处的元素之和等于较高指数处的元素之和。

例如,在序列$ A $中

:::: $ A_0 = -7 $

:::: $ A_1 = 1 $

:::: $ A_2 = 5 $

:::: $ A_3 = 2 $

:::: $ A_4 = -4 $

:::: $ A_5 = 3 $

:::: $ A_6 = 0 $

3是均衡指数,因为:

:::: $ A_0 + A_1 + A_2 = A_4 + A_5 + A_6 $

6也是均衡指数,因为:

:::: $ A_0 + A_1 + A_2 + A_3 + A_4 + A_5 = 0 $

(零元素之和为零)

7不是均衡指数,因为它不是序列$ A $的有效索引。

编写一个函数,给定一个序列,返回其平衡指数(如果有的话)。

假设序列可能很长。

## Instructions
## Tests
```yml tests: - text: equilibrium是一种功能。 testString: 'assert(typeof equilibrium === "function", "equilibrium is a function.");' - text: 'equilibrium([-7, 1, 5, 2, -4, 3, 0]) [3,6] equilibrium([-7, 1, 5, 2, -4, 3, 0])应该返回[3,6] 。' testString: 'assert.deepEqual(equilibrium(tests[0]), ans[0], "equilibrium([-7, 1, 5, 2, -4, 3, 0]) should return [3,6].");' - text: 'equilibrium([2, 4, 6])应该返回[] 。' testString: 'assert.deepEqual(equilibrium(tests[1]), ans[1], "equilibrium([2, 4, 6]) should return [].");' - text: 'equilibrium([2, 9, 2])应该返回[1] 。' testString: 'assert.deepEqual(equilibrium(tests[2]), ans[2], "equilibrium([2, 9, 2]) should return [1].");' - text: 'equilibrium([1, -1, 1, -1, 1, -1, 1])应该返回[0,1,2,3,4,5,6] 。' testString: 'assert.deepEqual(equilibrium(tests[3]), ans[3], "equilibrium([1, -1, 1, -1, 1, -1, 1]) should return [0,1,2,3,4,5,6].");' - text: 'equilibrium([1])应该返回[0] 。' testString: 'assert.deepEqual(equilibrium(tests[4]), ans[4], "equilibrium([1]) should return [0].");' - text: 'equilibrium([])应该返回[] 。' testString: 'assert.deepEqual(equilibrium(tests[5]), ans[5], "equilibrium([]) should return [].");' ```
## Challenge Seed
```js function equilibrium (a) { // Good luck! } ```
### After Test
```js console.info('after the test'); ```
## Solution
```js // solution required ```