-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathEqualSum.java
61 lines (58 loc) · 1.62 KB
/
EqualSum.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
57
58
59
60
61
/**
*
* Copyright 2016 Xiaofei
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
package xiaofei.algorithm;
/**
* Created by Xiaofei on 16/6/2.
*/
public class EqualSum {
public static void find(int[] arr) {
int length = arr.length;
for (int i = 0; i < length; ++i) {
System.out.print(" " + arr[i]);
}
System.out.println();
int i = 0;
int j = length - 1;
int s1 = arr[i];
int s2 = arr[j];
while (i < length && j >= 0) {
if (s1 == s2) {
System.out.println("i = " + i + " j = " + j);
++i;
--j;
if (i == length || j == -1) {
break;
}
s1 += arr[i];
s2 += arr[j];
} else if (s1 < s2) {
++i;
if (i == length) {
break;
}
s1 += arr[i];
} else {
--j;
if (j == -1) {
break;
}
s2 += arr[j];
}
}
}
}