<awangdev>287. Find the Duplicate Number_1.java
public int findDuplicate(int[] nums) {
        int slow = nums[0], fast = nums[nums[0]]; 
        while (slow != fast) {
            slow = nums[slow];
            fast = nums[nums[fast]];
        }
        int finder = 0;
        while (slow != finder) {
            slow = nums[slow];
            finder = nums[finder];
        }
        return slow;
    }
public int sample_funcname ( int [ ] var_0 ) {
  int var_2 = var_0 [ 0 ] , var_3 = var_0 [ var_0 [ 0 ] ] ;
  while ( var_2 != var_3 ) {
    var_2 = var_0 [ var_2 ] ;
    var_3 = var_0 [ var_0 [ var_3 ] ] ;
  }
  int var_4 = 0 ;
  while ( var_2 != var_4 ) {
    var_2 = var_0 [ var_2 ] ;
    var_4 = var_0 [ var_4 ] ;
  }
  return var_2 ;
}
