func (q *Queue) Dequeue() int {
	v := q.a[q.j]
	q.j = (q.j + 1) % cap(q.a)
	q.n--
	if cap(q.a) >= 3*q.n {
		q.resize()
	}
	return v
}
// Dequeue gets the last element v of a Queue and delete it from the Queue

Dequeue gets the last element v of a Queue and delete it from the Queue
// Dequeue gets the last element v of a Queue and delete it from the Queue
func (q *Queue) Dequeue() int {
	v := q.a[q.j]
	q.j = (q.j + 1) % cap(q.a)
	q.n--
	if cap(q.a) >= 3*q.n {
		q.resize()
	}
	return v
}
func ( q * Queue ) Dequeue ( ) int { v := q . a [ q . j ] q . j = ( q . j + 1 ) % cap ( q . a ) q . n -- if cap ( q . a ) >= 3 * q . n { q . resize ( ) } return v }
Dequeue gets the last element v of a Queue and delete it from the Queue
Dequeue gets the last element v of a Queue and delete it from the Queue