Skip to content

Update CircularLinkedList.java #4

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
RanchCoder wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update CircularLinkedList.java #4

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
50 changes: 28 additions & 22 deletions CircularLinkedList.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -123,36 +123,42 @@ public boolean contains(int data){

// to remove the element from the list of specified data
public int remove(int data){

if(tail == null) return Integer.MIN_VALUE;
CllNode temp = tail.getNext();
if(isEmpty()){
return Integer.MIN_VALUE;
}
CllNode atPos = tail.getNext();
CllNode previous = tail;

int element;
for(element = 0 ; element < length && (!(temp.getData() == data)) ; element++){
for(int i = 0 ; i < length && (!(atPos.getData() == data)) ; i++ ){
previous = previous.getNext();
temp = temp.getNext();
atPos = atPos.getNext();
}

if(temp.getData() == data){


if(tail == tail.getNext()){
tail = null;

}
else{
if(temp == tail){
tail = previous;
previous.setNext(previous.getNext().getNext());
if(atPos.getData() == data){
if(tail == tail.getNext()){
tail = null;

}

else{
if(atPos == tail){


previous.setNext(previous.getNext().getNext());
tail = previous;
}else{
previous.setNext(previous.getNext().getNext());

}


}
atPos.setNext(null);
length--;
return atPos.getData();
}
temp.setNext(null);
length--;
return temp.getData();
else{
return Integer.MIN_VALUE;
}
else return Integer.MAX_VALUE;

}
public int size(){
Expand Down