Stack and queue-p78-8 [2011 unified examination true question]

Reading questions ： Queue non-empty time ,front Point to the team header element ,rear Point to the end element

reflection ：

common , commonly rear Point to the next... Of the tail element

                        To store elements is to store them first rear Memory pointed to ,

                        And then move rear Next person

however , subject rear Point to the end element

                        Then the storage element is moved first rear To next

                        Then store the element in rear The space in question

reflection ：

When will it be modified front,rear value

                 When inserting, it will be modified rear value ,rear Value meeting +1

                 When deleting, it will be modified front value ,front Value meeting +1

obtain front The initial value of the ：

        The first element to enter the queue is stored in A[0]

                 When the queue is not empty ,front Point to the team header element ,rear Point to the end element

                 that front = 0,rear = 0 【 Note that this is after inserting the first element front, and rear value 】

                【 The title requires the initial front Values and rear value 】

                 The first element to enter the queue is stored in A[0]

         This operation is an insert operation , influence rear value , No effect front value

                At the beginning front The value is 0

        initial rear How to get the value

                         subject rear Point to the end element

                                         Then the storage element is moved first rear To next

                                         Then store the element in rear The space in question

                          in other words rear Is to move to the next position first , Only then 0

                                        Then there is no insertion A[0] The value of time should be 0 My last

                                        This queue is a circular queue

                                        that 0 The last one is n-1