约瑟夫环：每隔两个循环删除数组元素--fr csdn（国外英文资料）.doc

约瑟夫环：每隔两个循环删除数组元素--fr csdn（国外英文资料） C/C + + interview algorithm series - Joseph ring: remove the array element every two cycles, and ask for the subscript of the final delete ... There is an array a [1000] that holds 0-1000; Requires every two number to delete a number, to the end of the cycle to continue in the beginning, for the last number deleted the original subscript position (the original number might be disorderly, repeatedly from the question can not be sure whether a number). Consider the eight Numbers: ,1,2,3,4,5,6,7 {0} 0 - 1 2 (delete) -- - 3 - - 4 - 5 (delete) -- -- -- -- 6 7 0 (delete), so the cycle until the final number is deleted. The examination site: Subject is the key to how to understand the concept of deleting a is to delete it, behind will not delete all moved forward, it will waste a lot of time to move the subsequent data; The other one is still there but has lost meaning, and no matter what it is. Another key is how to keep the data in the process of moving the original subscript, because the data itself may be disorderly, subscript and data may not have the relations, and may also be repeated Performance analysis: Time efficiency: the loop queue method is the most efficient because each scan is undeleted. The flag array method simply marks the number as deleted, but it is still scanned; The linked list method is to establish the chain, the time efficiency is low Space efficiency: the symbol array method, which does not apply for extra space, is the most efficient. Circular queue method application for the first time, at least not to delete the space, also as the interface function to implement, because of the new applications of space can not be connected with the incoming array address, thus there are limitations; The linked list method is the most efficient way to set up a linked list Constraint factors: For read-only arrays, no common notation can be used, and the method of cleaning up a high position one time is the most import