git-subtree-dir: users/wpcarro git-subtree-mainline:464bbcb15cgit-subtree-split:24f5a642afChange-Id: I6105b3762b79126b3488359c95978cadb3efa789
		
			
				
	
	
		
			22 lines
		
	
	
	
		
			448 B
		
	
	
	
		
			Python
		
	
	
	
	
	
			
		
		
	
	
			22 lines
		
	
	
	
		
			448 B
		
	
	
	
		
			Python
		
	
	
	
	
	
| import random
 | |
| 
 | |
| def find_duplicate(xs):
 | |
|     print(xs)
 | |
|     # entry point in our cycle is the duplicate
 | |
|     i = xs[0]
 | |
|     j = xs[xs[0]]
 | |
|     while i != j:
 | |
|         print(i, xs[i], j, xs[j])
 | |
|         i = xs[i]
 | |
|         j = xs[xs[j]]
 | |
|     # detect cycle
 | |
|     j = 0
 | |
|     while i != j:
 | |
|         i = xs[i]
 | |
|         j = xs[j]
 | |
|     return xs[i]
 | |
| 
 | |
| n = random.randint(5, 10)
 | |
| xs = [random.randint(0, n - 1) for _ in range(n)]
 | |
| result = find_duplicate(xs)
 | |
| print(xs, result)
 |