-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathArraylist.java
80 lines (67 loc) · 2 KB
/
Arraylist.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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
import java.util.*;
public class Arraylist {
//BrutForce Approch
public static void maxWaterContainer(ArrayList<Integer> list){
int maxWater=-1;
for (int i = 0; i < list.size(); i++) {
for (int j = i +1 ; j < list.size(); j++) {
int height = Math.min(list.get(i), list.get(j));
int width = j - i;
maxWater=Math.max(maxWater, width*height);
}
}
System.out.println("It can contain: "+maxWater+" amount of water");
}
//Two Pointer Approch
public static void maxWaterContainer2(ArrayList<Integer> list){
int maxWater=-1;
int lp=0, rp=list.size()-1;
while (lp < rp) {
int height=Math.min(list.get(lp), list.get(rp));
int width=rp-lp;
maxWater=Math.max(maxWater, width*height);
if (list.get(lp)<list.get(rp)) {
lp++;
}else{
rp--;
}
}
System.out.println("It can contain: "+maxWater+" amount of water");
}
//pair sum
public static boolean pairSum(ArrayList<Integer> list, int target){
list.sort(null);
int lp=0;
int rp=list.size()-1;
int sum=-1;
while (lp<rp) {
sum=list.get(lp)+list.get(rp);
if (sum > target) {
rp--;
}
else if(sum < target){
lp++;
}
else{
return true;
}
}
return false;
}
public static void main(String[] args) {
ArrayList<Integer> height =new ArrayList<>();
height.add(1);
height.add(8);
height.add(6);
height.add(2);
height.add(5);
height.add(4);
height.add(8);
height.add(3);
height.add(7);
System.out.println(height);
// maxWaterContainer(height);
// maxWaterContainer2(height);
System.out.println(pairSum(height, 5));
}
}