forked from rampatra/Algorithms-and-Data-Structures-in-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathEquilibriumIndex.java
56 lines (50 loc) · 1.87 KB
/
EquilibriumIndex.java
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
package com.rampatra.arrays;
/**
* Created by IntelliJ IDEA.
*
* @author rampatra
* @since 8/22/15
* @time: 11:56 AM
*/
public class EquilibriumIndex {
/**
* EQUILIBRIUM INDEX of an array is an index such that the sum of elements at lower
* indexes is equal to the sum of elements at higher indexes.
* <p/>
* For example, in an array A = {-7, 1, 5, 2, -4, 3, 0}
* <p/>
* 3 is an equilibrium index, because
* A[0] + A[1] + A[2] = A[4] + A[5] + A[6]
* <p/>
* 6 is also an equilibrium index, because sum of zero elements is zero,
* i.e., A[0] + A[1] + A[2] + A[3] + A[4] + A[5] = 0
* <p/>
* 7 is not an equilibrium index, because it is not a valid index of array A.
*
* @param a
* @return equilibrium index of array {@param a}.
*/
public static int getEquilibriumIndex(int[] a) {
int totalSum = 0, leftSum = 0;
for (int i = 0; i < a.length; i++) {
totalSum += a[i];
}
for (int i = 0; i < a.length; i++) {
totalSum -= a[i]; // totalSum now holds the right sum from ith index to end
if (leftSum == totalSum) {
return i; // left sum == right sum
}
leftSum += a[i]; // update left sum
}
return -1;
}
public static void main(String[] args) {
System.out.println(getEquilibriumIndex(new int[]{-7, 1, 5, 2, -4, 3, 0}));
System.out.println(getEquilibriumIndex(new int[]{-7, 1, 5, 0, 0, 0, 0, 1, 2, -4, 1, 3, 0}));
System.out.println(getEquilibriumIndex(new int[]{4, 5, 2, 1, 6, 7, 8, 0, 1}));
System.out.println(getEquilibriumIndex(new int[]{0}));
System.out.println(getEquilibriumIndex(new int[]{0, 0, 0}));
System.out.println(getEquilibriumIndex(new int[]{1, 1}));
System.out.println(getEquilibriumIndex(new int[]{1, 1, 1}));
}
}