algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-09 20:20:56 +08:00
Code Issues 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
parent 2dce3bce24 ef767fc4d5
commit ee0a48fa14
1 changed files with 3 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
DataStructures/Queues/Queues.java
View File

@ -53,9 +53,7 @@ class Queue {
public boolean insert(int x) { public boolean insert(int x) {
if (isFull()) if (isFull())
return false; return false;
if (rear == maxSize - 1) // If the back of the queue is the end of the array wrap around to the front rear = (rear + 1) % maxSize; // If the back of the queue is the end of the array wrap around to the front
rear = -1;
rear++;
queueArray[rear] = x; queueArray[rear] = x;
nItems++; nItems++;
return true; return true;
@ -72,9 +70,7 @@ class Queue {
return -1; return -1;
} }
int temp = queueArray[front]; int temp = queueArray[front];
front++; front = (front + 1) % maxSize;
if (front == maxSize) //Dealing with wrap-around again
front = 0;
nItems--; nItems--;
return temp; return temp;
} }