编写算法依次访问无头结点的单循环链表 求两个递增有序链表的交集和并集。-Algorithm followed by the preparation of the visit without a head node for the single round-robin list two incremental and orderly list and set the ground.