Skip to content

optimization #864

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
yanglbme merged 1 commit into from
Sep 26, 2019
Merged

optimization #864

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
10 changes: 3 additions & 7 deletions DataStructures/Queues/Queues.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -53,9 +53,7 @@ public Queue(int size) {
public boolean insert(int x) {
if (isFull())
return false;
if (rear == maxSize - 1) // If the back of the queue is the end of the array wrap around to the front
rear = -1;
rear++;
rear = (rear + 1) % maxSize; // If the back of the queue is the end of the array wrap around to the front
queueArray[rear] = x;
nItems++;
return true;
Expand All @@ -72,9 +70,7 @@ public int remove() { // Remove an element from the front of the queue
return -1;
}
int temp = queueArray[front];
front++;
if (front == maxSize) //Dealing with wrap-around again
front = 0;
front = (front + 1) % maxSize;
nItems--;
return temp;
}
Expand Down Expand Up @@ -153,6 +149,6 @@ public static void main(String args[]) {
// [7(rear), 2(front), 5, 3]

System.out.println(myQueue.peekFront()); // Will print 2
System.out.println(myQueue.peekRear()); // Will print 7
System.out.println(myQueue.peekRear()); // Will print 7
}
}