Description: Joseph Ring is a typical problem with circular list data structure is a list of the last element pointer to force the first element. The core problem-solving steps: 1. To establish a link with n-points, without a head of circular list node 2. Identified the first one reported the location of several people 3. Continuously removed from the list link point, until the list is empty. Specific process is to first build a one-way circular linked list, these people used to store code and password. Then delete the number m of people reported in these individuals at the same time remove the password and label output. Delete this list until it is empty. This is what I solve this problem.
To Search:
File list (Check if you may need any files):
约瑟夫环.txt
Download