-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPairSum2b.java
More file actions
44 lines (39 loc) · 1.04 KB
/
Copy pathPairSum2b.java
File metadata and controls
44 lines (39 loc) · 1.04 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
import java.util.ArrayList;
import java.util.*;
public class PairSum2b{
public static boolean isPresent(ArrayList<Integer> list, int target){
int bp = -1;
int n = list.size();
for(int i=0; i<n; i++){
if(list.get(i) > list.get(i+1)){//breaking point
bp = i;
break;
}
}
int lp = bp+1;//smallest
int rp = bp;//largest
while(lp != rp){
if(list.get(lp) + list.get(rp) == target){
return true;
}
else if(list.get(lp) + list.get(rp) < target){
lp = (lp+1)%n;
}
else{
rp = (n+rp-1)%n;
}
}
return false;
}
public static void main(String args[]){
ArrayList<Integer> list = new ArrayList<>();
list.add(11);
list.add(15);
list.add(6);
list.add(8);
list.add(9);
list.add(10);
int target = 15;
System.out.println(isPresent(list, target));
}
}