algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-10 21:43:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

make code less

Browse Source
This commit is contained in:
shellhub
2019-09-26 16:14:51 +08:00
parent f0bdd2b646
commit 947127cfb6
1 changed files with 6 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
DataStructures/Queues/PriorityQueues.java
View File

@ -42,18 +42,15 @@ class PriorityQueue {
public void insert(int value) { public void insert(int value) {
if (isFull()) { if (isFull()) {
throw new RuntimeException("Queue is full"); throw new RuntimeException("Queue is full");
}
if (nItems == 0) {
queueArray[0] = value;
} else { } else {
int j = nItems; int j = nItems - 1; // index of last element
while (j > 0 && queueArray[j - 1] > value) { while (j >= 0 && queueArray[j] > value) {
queueArray[j] = queueArray[j - 1]; // Shifts every element up to make room for insertion queueArray[j + 1] = queueArray[j]; // Shifts every element up to make room for insertion
j--; j--;
} }
queueArray[j] = value; // Once the correct position is found the value is inserted queueArray[j + 1] = value; // Once the correct position is found the value is inserted
} nItems++;
nItems++; }
} }
/** /**