An array that deletes a number every two numbers, goes to the end of the array, and continues to go through the bad, resulting in the subscript of the last element removed

2. Public class Deleteeverytwo {
4. public static void Main (string[] args) {
6. int index = GETLASTDELETEDINDEX (8);
8. System.out.println ("The Last index deleted is" + index);
10. }
14. /** 
16. *
18. * @param a
20. * Array length
22. * @return The original subscript of the last deleted number
24. */
26. public static int getlastdeletedindex (int len) {
28. If (len <= 0) { //return-1 if the array length does not meet the requirements
30. return-1;
32. }
36. int[] arr = new Int[len];
38. for (int i = 0; i < len; i++) { //Initialize the value of each element as the current subscript
40. Arr[i] = len;
42. }
46. final int delflag = len + 1; //Remove flag bit
48. int currentsize = len; //Record the current valid length of the array (that is, the number of elements that are not set to the delete flag), and finally to 0
50. final int STEP = 2; //Step
52. int count = 0; //Step count
54. int lastdelindex = 0; //Record the subscript of the last deleted element
56. int i = 0; //Cycle subscript
60. While (currentsize! = 0) {
62. if (arr[i]! = Delflag) { //interpret whether the current element equals the delete flag
64. if (count++ = = Step) { //When the step count satisfies the step size
66. Arr[i] = Delflag; //Set element to delete flag bit
68. Lastdelindex = i; //Record the subscript of the place
70. currentsize--; //valid array length minus 1
72. Count = 0; //Step count zeroing
74. System.out.println ("Deleted index is" + i% len);
76. }
78. }
80. i = (i + 1)% Len; //subscript take -off to achieve cyclic subscript
82. }
84. return lastdelindex;
86. }
88. }

An array that deletes a number every two numbers, goes to the end of the array, and continues to go through the bad, resulting in the subscript of the last element removed