用带表头的链表存放输入的数据，每读入一个数，按升序顺序插入到链表中，链表中允许两个结点有相同值。链表的头结点存放链表后面的结点个数，初始化时就生成头结点（初值为0）。链表翻转是把数据逆序（变成降序），注意，头结点不动。翻转后要再翻转一次，恢复升序后才能插入新元素，否则会出错。-Using the list with the first table input data storage, each read a few, according to ascending order of inserted into the list, the list allows the two nodes have the same value. List the first node behind the storage node list the number of generated when initializing the first node (the initial value for 0). List of data inversion is to reverse (into descending), note that the first fixed node. Flip flip again after the first, after ascending to restore order to insert a new element, or else they will make mistakes.