输入n(n>1)个正整数，每次将输入的整数插入到链表头部。-1表示输入结束。再输入一个正整数，在链表中查找该数据并删除对应的节点。要求输出进行删除操作后链表中所有节点的值。 -Enter n (n>　1) positive integers, each integer input into the list head.-1 Means end of input. Enter a positive integer, find the data in the list and delete the corresponding node. Output after a delete operation requires all nodes in the value chain.