classMaxQueue{//题目要求是10000;int[] q =newint[20002];int begin =0, end =0;publicMaxQueue(){}publicintmax_value(){int ans =-1;//遍历取得最大值。for(int i = begin; i != end;++i){
ans = Math.max(ans, q[i]);}return ans;}publicvoidpush_back(int value){
q[end++]= value;}publicintpop_front(){if(begin == end){return-1;}return q[begin++];}}