algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-09 12:11:28 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #995 from shellhub/master

Browse Source 
toString
This commit is contained in:
Yang Libin
2019-10-10 14:06:58 +08:00
committed by GitHub
parent ed999c1a42 5b185e8191
commit 86d6a59fb4
1 changed files with 16 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
DataStructures/Queues/Queues.java
View File

@ -130,6 +130,20 @@ class Queue {
public int getSize() { public int getSize() {
return nItems; return nItems;
} }
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append("[");
for (int i = front; ; i = ++i % maxSize) {
sb.append(queueArray[i]).append(", ");
if (i == rear) {
break;
}
}
sb.replace(sb.length() - 2, sb.length(), "]");
return sb.toString();
}
} }
/** /**
@ -143,7 +157,7 @@ public class Queues {
* *
* @param args Command line arguments * @param args Command line arguments
*/ */
public static void main(String args[]) { public static void main(String[] args) {
Queue myQueue = new Queue(4); Queue myQueue = new Queue(4);
myQueue.insert(10); myQueue.insert(10);
myQueue.insert(2); myQueue.insert(2);
@ -161,5 +175,6 @@ public class Queues {
System.out.println(myQueue.peekFront()); // Will print 2 System.out.println(myQueue.peekFront()); // Will print 2
System.out.println(myQueue.peekRear()); // Will print 7 System.out.println(myQueue.peekRear()); // Will print 7
System.out.println(myQueue.toString()); // Will print [2, 5, 3, 7]
} }
} }