Java beats 100% speed, O(1) space
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int reinitializePermutation(int n) {\n        int index = 1;\n        int count = 0;\n        while (true) {\n            count++;\n            index = index<n/2 ? 2*index: 1+2*index-n;\n            if (index == 1) return count;\n        }\n    }\n}\n```
['Java']