@@ -0,0 +1,538 @@
+/**%0A * Problem Link: https://leetcode.com/problems/find-the-duplicate-number/%0A * %0A * Binary Search.%0A */%0A%0Apublic class Solution %7B%0A    public int findDuplicate(int%5B%5D nums) %7B%0A        int left = 1; %0A        int right = nums.length - 1;%0A        while(left %3C right) %7B%0A            int mid = (left + right) / 2;%0A            int g = 0;%0A            for(int i=0; i%3Cnums.length; i++) %7B%0A                if(nums%5Bi%5D %3C= mid) g++;%0A            %7D%0A            if(g %3C= mid) left = mid + 1;%0A            else right = mid;%0A        %7D%0A        return left;%0A    %7D%0A%7D%0A

Create Find_the_Duplicate_Number.java