手写queue

#include<bits/stdc++.h>
using namespace std;
class myqueue{
    public:
        void push(int x){
            r++;
            a.push_back(x);
        }
        void pop(){
            if(l<=r)l++;
        }
        int front(){
            return a[r-1];
        }
        int end(){
            return a[l-1];
        }
        int size(){
            return r-l+1;
        }
        bool empty(){
            return (r+1)==l;
        }
        void swap(myqueue x,myqueue y){
            myqueue *x1=&x,*x2=&y,*x3;
            x3=x1;
            x1=x2;
            x2=x3;
        }
        void clear(){
            l=1;
            r=0;
            a.clear();
        }
    private:
        int l,r;
        vector<int>a;
};