一、队列
二、代码实现
package com. xianxing. queue;
public class MyQueue {
int [ ] elements;
public MyQueue ( ) {
elements = new int [ 0 ] ;
}
public String show ( ) {
String stringQueue = "" ;
for ( int i = 0 ; i < elements. length; i++ ) {
stringQueue += elements[ i] + " " ;
}
return stringQueue;
}
public void add ( int element) {
int newArr[ ] = new int [ elements. length + 1 ] ;
for ( int i = 0 ; i < elements. length; i++ ) {
newArr[ i] = elements[ i] ;
}
newArr[ elements. length] = element;
elements = newArr;
}
public int poll ( ) {
int element = elements[ 0 ] ;
int [ ] newArr = new int [ elements. length - 1 ] ;
for ( int i = 0 ; i < newArr. length; i++ ) {
newArr[ i] = elements[ i + 1 ] ;
}
elements = newArr;
return element;
}
public boolean isEmpty ( ) {
return elements. length == 0 ;
}
}
package com. xianxing. queue;
public class TestMyQueue {
public static void main ( String[ ] args) {
MyQueue mq = new MyQueue ( ) ;
mq. add ( 9 ) ;
mq. add ( 8 ) ;
mq. add ( 7 ) ;
mq. add ( 6 ) ;
System. out. println ( mq. show ( ) ) ;
System. out. println ( mq. poll ( ) ) ;
System. out. println ( mq. poll ( ) ) ;
System. out. println ( mq. poll ( ) ) ;
System. out. println ( mq. isEmpty ( ) ) ;
mq. poll ( ) ;
System. out. println ( mq. isEmpty ( ) ) ;
}
}