Skip to content

Fixes: NoClassDefFoundError in CircularQueue.java #2838

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

Merged
siriak merged 2 commits into from
Nov 23, 2021
Merged

Fixes: NoClassDefFoundError in CircularQueue.java #2838

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
122843d
fix a NoClassDefFoundError exception
FyZhu97 Nov 22, 2021
bd51e90
Merge branch 'master' into master
siriak Nov 23, 2021
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
57 changes: 27 additions & 30 deletions src/main/java/com/thealgorithms/datastructures/queues/CircularQueue.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,41 +4,12 @@
//Link to the concept: (https://en.wikipedia.org/wiki/Circular_buffer)
public class CircularQueue {

public static void main(String[] args) {
circularQueue cq = new circularQueue(5);
System.out.println(cq.isEmpty());
System.out.println(cq.isFull());
cq.enQueue(1);
cq.enQueue(2);
cq.enQueue(3);
cq.enQueue(4);
cq.enQueue(5);

System.out.println(cq.deQueue());
System.out.println(cq.deQueue());
System.out.println(cq.deQueue());
System.out.println(cq.deQueue());
System.out.println(cq.deQueue());
System.out.println(cq.isFull());
System.out.println(cq.isEmpty());
cq.enQueue(6);
cq.enQueue(7);
cq.enQueue(8);
System.out.println(cq.peek());
System.out.println(cq.peek());
cq.deleteQueue();

}
}

class circularQueue {

int[] arr;
int topOfQueue;
int beginningOfQueue;
int size;

public circularQueue(int size) {
public CircularQueue(int size) {
arr = new int[size];
topOfQueue = -1;
beginningOfQueue = -1;
Expand Down Expand Up @@ -115,4 +86,30 @@ public void deleteQueue() {
System.out.println("The Queue is deleted!");
}


public static void main(String[] args) {
CircularQueue cq = new CircularQueue(5);
System.out.println(cq.isEmpty());
System.out.println(cq.isFull());
cq.enQueue(1);
cq.enQueue(2);
cq.enQueue(3);
cq.enQueue(4);
cq.enQueue(5);

System.out.println(cq.deQueue());
System.out.println(cq.deQueue());
System.out.println(cq.deQueue());
System.out.println(cq.deQueue());
System.out.println(cq.deQueue());
System.out.println(cq.isFull());
System.out.println(cq.isEmpty());
cq.enQueue(6);
cq.enQueue(7);
cq.enQueue(8);
System.out.println(cq.peek());
System.out.println(cq.peek());
cq.deleteQueue();

}
}