-
Notifications
You must be signed in to change notification settings - Fork 0
/
String_ArrayList_collection.java
122 lines (111 loc) · 3.5 KB
/
String_ArrayList_collection.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
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
package collections;
import java.util.*;
interface StringSort{
public void sort();
}
public class String_ArrayList_collection {
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println("*************** Hello 18BCI0174 - Aryan ****************");
//arrayList
ArrayList<String> list =new ArrayList<String>();
list.add("It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout. ");
list.add("The point of using Lorem Ipsum is that it has a more-or-less normal distribution of letters, as opposed to using 'Content here, content here', making it look like readable English. ");
list.add("Many desktop publishing packages and web page editors now use Lorem Ipsum as their default model text, and a search for 'lorem ipsum' will uncover many web sites still in their infancy.");
list.add("Various versions have evolved over the years, sometimes by accident, sometimes on purpose (injected humour and the like).");
int size=list.size(); // List size
StringSort length =()->{
//lambda expression for length sort
String t;
for(int i=0;i<size;i++) {
for(int j=i;j<size;j++) {
if((list.get(i)).length()>(list.get(j)).length()) {
t=list.get(i);
list.set(i,list.get(j));
list.set(j,t);
}
}
}
//Traversing list through iterator
Iterator itr=list.iterator();
while(itr.hasNext()) {
System.out.println(itr.next());
}
};
StringSort lengthreverse =()->{
//lambda expression for length sort
String t;
for(int i=0;i<size;i++) {
for(int j=i;j<size;j++) {
if((list.get(i)).length()<(list.get(j)).length()) {
t=list.get(i);
list.set(i,list.get(j));
list.set(j,t);
}
}
}
//Traversing list through iterator
Iterator itr=list.iterator();
while(itr.hasNext()) {
System.out.println(itr.next());
}
};
StringSort alphabatical =()->{
//lambda expression for length sort
String t;
for(int i=0;i<size;i++) {
char a=(list.get(i)).charAt(0); //only first character
for(int j=i;j<size;j++) {
char b=(list.get(j)).charAt(0); //only first character
int compare = Character.compare(a,b);
if(compare>0) {
t=list.get(i);
list.set(i,list.get(j));
list.set(j,t);
}
else {
continue;
}
}
}
//Traversing list through iterator
Iterator itr=list.iterator();
while(itr.hasNext()) {
System.out.println(itr.next());
}
};
StringSort withe =()->{
//lambda expression for length sort
String t;
for(int i=0;i<size;i++) {
for(int j=i;j<size;j++) {
int a=(list.get(i)).indexOf("e");
int b=(list.get(j)).indexOf("e");
if(a>b) {
t=list.get(i);
list.set(i,list.get(j));
list.set(j,t);
}
else {
continue;
}
}
}
//Traversing list through iterator
Iterator itr=list.iterator();
while(itr.hasNext()) {
System.out.println(itr.next());
}
};
// calling lambda functions
System.out.println("[+] Sorting as");
System.out.println("[~] Length i.e. shortest to longest");
length.sort();
System.out.println("\n[~] Reversed Length i.e. longest to shortest");
lengthreverse.sort();
System.out.println("\n[~] alphabatically i.e. first character");
alphabatical.sort();
System.out.println("\n[~] String with 'e' first");
withe.sort();
}
}