Time: 11 ms (55.13%), Space: 75.8 MB (51.58%) - LeetHub

Author: AndrewSpourgeon

0287-find-the-duplicate-number/0287-find-the-duplicate-number.java

@@ -0,0 +1,19 @@
+class Solution {
+    public int findDuplicate(int[] nums) {
+       int tortoise=nums[0];
+       int hare=nums[0];
+       do{
+           tortoise=nums[tortoise];
+           hare=nums[nums[hare]];
+       }while(tortoise!=hare);
+           
+       tortoise=nums[0];
+        
+        while(tortoise!=hare){
+           tortoise=nums[tortoise];
+           hare=nums[hare]; 
+        }
+       
+            return hare;
+    }
+}