Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Merge pull request #864 from shellhub/master

Browse Source 
optimization
This commit is contained in:
Yang Libin 2019-09-26 09:01:47 +08:00 committed by GitHub
commit ee0a48fa14
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
DataStructures/Queues/Queues.java
View File

@ -53,9 +53,7 @@ class Queue {
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;
@ -72,9 +70,7 @@ class 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;
}
@ -153,6 +149,6 @@ public class Queues {
// [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
}
}