-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmaxlist.java
More file actions
141 lines (113 loc) · 3.55 KB
/
Copy pathmaxlist.java
File metadata and controls
141 lines (113 loc) · 3.55 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
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
import java.util.*;
public class maxlist {
public static int maximum(ArrayList<Integer> list){
int max = Integer.MIN_VALUE;
for(int i=0; i<list.size(); i++){
if(max < list.get(i)){
max = list.get(i);
}
}
return max;
}
public static int smallest(ArrayList<Integer>list){
int min = Integer.MAX_VALUE;
for(int i=0; i<list.size(); i++){
if(min > list.get(i)){
min = list.get(i);
}
}
return min;
}
public static void reverse(ArrayList<Integer>list){
for(int i=list.size()-1; i>=0; i--){
System.out.print(list.get(i)+ " ");
}
System.out.println();
}
public static void revrseList(ArrayList<Integer> list){
int start = 0, end = list.size()-1;
while(start < end){
int temp = Integer.valueOf(list.get(start));
list.set(start , list.get(end));
list.set(end, temp);
start++;
end--;
}
System.out.println("Reverse list is: " + list);
}
public static void swap(ArrayList<Integer> list, int idx1, int idx2){
int temp = list.get(idx1);
list.set(idx1, list.get(idx2));
list.set(idx2, temp);
System.out.print(list + " ");
}
public static void twoSum(ArrayList<Integer> list, int target){
int lp = 0;
int rp = list.size()-1;
while(lp != rp){
if(list.get(lp) + list.get(rp) == target){
System.out.println("pair sum is: " + list.get(lp) + "," + list.get(rp));
return;
}
else if(list.get(lp) + list.get(rp) < target){
lp++;
}
else{
rp--;
}
}
System.out.println("pair not exists");
}
public static void sortedRotatedSum(ArrayList<Integer> list, int target){
int bp = -1;
for(int i=0; i<list.size()-1; i++){
if(list.get(i)> list.get(i+1)){
bp = i;
break;
}
}
int lp = bp+1, n = list.size();
int rp = bp;
while(lp != rp){
if(list.get(lp) + list.get(rp) == target){
System.out.println("Pair sum is: " + list.get(lp) + "," + list.get(rp));
return;
}
if(list.get(lp) + list.get(rp) < target){
lp = (lp+1)%n;
}
else{
rp = (n+rp-1)%n;
}
}
System.out.println("Sum not exists");
}
public static void main(String args[]){
ArrayList<Integer> list = new ArrayList<>();
// list.add(2);
// list.add(6);
// list.add(3);
// list.add(9);
// list.add(7);
// list.add(6);
// list.add(5);
list.add(11);
list.add(15);
list.add(6);
list.add(8);
list.add(9);
list.add(10);
int x = maximum(list);
System.out.println("Maximum in list is: " + x);
int y = smallest(list);
System.out.println("minimum in list is: " + y);
reverse(list);
int idx1 = 0, idx2 = 4;
System.out.print(list+ " ");
swap(list, idx1, idx2);
revrseList(list);
int target = 18;
//twoSum(list, target);
sortedRotatedSum(list, target);
}
}