1. Create Josephloop. Create a non-head list, and appand the new node to the next pointer,.... Make the tail pointer point to the head and make the list a loop. Delete the tail node and make the second node's next point to the head.2. Report the number in sequence. From the head, print the number of the Mth node, and give this node's password to M, then delete this node. Till the list only has one node, then print this node's number.
解决方案 »
免费领取超大流量手机卡,每月29元包185G流量+100分钟通话, 中国电信官方发货