leetcode学习笔记31

287. Find the Duplicate Number

Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, find the duplicate one.

1、暴力解法 时间复杂度为O(n^2)

class Solution {
    public int findDuplicate(int[] nums) {
        for(int i=0;i<nums.length;i++){
                for(int j=i+1;j<nums.length;j++){
                    if(nums[i]==nums[j])
                        return nums[i];
            }
        }
        return 0;
    }
}

2、二分查找法，借鉴网上的思路，时间复杂度
时间复杂度为O（n）

class Solution {
    public int findDuplicate(int[] nums) {
        int left=0,right=nums.length;
        while(left<right){
            int mid=(left+right)/2,count=0;
            for(int num:nums){
                if(num<=mid){
                    count++;
                }
            }
            if(count<=mid)left=mid+1;
            else right=mid;
        }
        return right;
    }
}

3、一种更优的解法，采用有环链表的方式
https://blog.csdn.net/monkeyduck/article/details/50439840
参考这篇文章

class Solution {
    public int findDuplicate(int[] nums) {
        int slow = 0, fast = 0, t = 0;
        while (true) {
            slow = nums[slow];
            fast = nums[nums[fast]];
            if (slow == fast) break;
        }
        while (true) {
            slow = nums[slow];
            t = nums[t];
            if (slow == t) break;
        }
        return slow;
    }
}