
class list { public int integer; public String elem; public list next; private Exception nothing; public int r;
public list() {
this(null,null,0);
}
public list(String e,int i) {
this.elem = e;
this.next = null;
this.integer=i;
}
public list(String e, list n ,int i) {
elem = e;
next = n;
integer=i;
}
public void addElem(String newElem,int i1 ) {
if (this.elem == null) {
this.elem = newElem;
this.next = null;
this.integer=i1;
} else {
list l = new list(elem, next, integer);
this.next = l;
this.elem = newElem;
this.integer=i1;
}
}
public String getFirst() {
return elem;
}
public boolean isEmpty() {
if (next.getNext()==null)
return true;
return false;
}
public String getElem() {
return elem;
}
public int getint() {
return integer;
}
public list getNext() {
return next;
}
public int length(list next) {
int o =0;
while(next.elem != null){
o++;
next = next.getNext();
}
return o;
}
public void setNext(list next)
{ this.next=next; }
}
class arraylist{ public static list[] abcd; public static int p=0; public int q=0; public static int i=0;
public arraylist() { int x=0; for(x=0;x<5001;x++){ this.abcd[x] = new list(); }}
public static int ascii(String s){ int f=0;
for (int i=0; i }
return f;
} for (int k=0; k }
return g; for (y=0;y } return "not found";
} } class FileRead { public static int ascii(String s){
int f=0; for (int i=0; i }
return f;
} for (int i=0; i }
return g; while (arraylist.abcd[p].getint()!=0) {
if(q==arraylist.abcd[p].getint()) {
arraylist.abcd[p] = arraylist.abcd[p].getNext();
return arraylist.abcd[p].getElem(); } public static int ascii3(String s){
int g=0;
}public static String finder(int p,int q){
int y=0;
}
else
arraylist.abcd[p] = arraylist.abcd[p].getNext();
public static int ascii3(String s){
int g=0;
}public static String finder(int p,int q){
int i;
}
else
arraylist.abcd[p] = arraylist.abcd[p].getNext();
If you are facing any programming issue, such as compilation errors or not able to find the code you are looking for.
Ask your questions, our development team will try to give answers to your questions.