假设在长度大于1的单循环链表中，既无头结点也无头指针。s为指向某个结点的指针，试编写算法删除结点*s的直接前驱结点，该程序是数据结构的范例-Assuming the single cycle in length greater than 1 in the list, neither the first nor the head node pointer. s is a pointer pointing to a node, delete node algorithm test preparation* s direct predecessor node, the program is an example of data structure