1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51
|
public class { private String[] array; private int head = 0; private int tail = 0; private int size = 0;
public (int size) { this.size = size; array = new String[size]; }
public void enque(String s) { if ((tail + 1) % size == head) { throw new RuntimeException("CircleQueuqe has full"); }
array[tail] = s; tail = (tail + 1) % size; }
public String deques() { if(head==tail){ throw new RuntimeException("CircleQueuqe has empty"); }
String ret=array[head]; head=(head+1)%size;
return ret; }
public String[] getArray() { return array; }
public int size() { return size; }
public String toString() { return "CircleQueuqe{" + "array=" + Arrays.toString(array) + ", head=" + head + ", tail=" + tail + ", size=" + size + '}'; } }
|
近期评论