Java实现泛型队列
发布时间:2020-12-15 07:29:37 所属栏目:Java 来源:网络整理
导读:class node{ int x; int y;} public class Test { public static void main(String[] args) { MyQueue String q= new MyQueueString (); q.push( "xxx" ); q.push( "xxx" ); q.push( "xxx" ); q.push( "你" ); q.push( "真" ); q.push( "666!" ); q.print()
class node{ int x; int y; } public class Test { public static void main(String[] args) { MyQueue<String> q=new MyQueue<String>(); q.push("xxx"); q.push("xxx"); q.push("xxx"); q.push("你"); q.push("真"); q.push("666!"); q.print(); System.out.println(q.GetMaxSize()); } } class MyQueue<T>{ public int HIndex=0; public int size=0; public int MaxSize=0; public T space[]; @SuppressWarnings("unchecked") public boolean push(T t) { if(MaxSize<=size){ MaxSize=MaxSize+((MaxSize>>1)>1?(MaxSize>>1):1); T temp[]=(T[])new Object[MaxSize]; for(int i=0;i<size;++i) { temp[i]=space[i]; } space=temp; } space[size++]=t; return true; } public boolean pop() { if(!isEmpty()) { HIndex++; size--; } return true; } public boolean isEmpty() { if(size==0) { return true; } return false; } public boolean print() { for(int i=HIndex;i<size;++i) { System.out.println(space[i]); } return true; } public int GetMaxSize() { return MaxSize; } } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |