创建长度为n的双向循环链表，值为整数。 查找第k个元素并输出。 删除所有值为m的元素。 逆置链表并输出。-To create a length of n two-way circulation list, the value of an integer. Find the first k elements and output. Delete all the value of m elements. Inverse Purchase list and output.