leetcode之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.

Note:

  1. You must not modify the array (assume the array is read only).
  2. You must use only constant, O(1) extra space.
  3. Your runtime complexity should be less than O(n2).
  4. There is only one duplicate number in the array, but it could be repeated more than once.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

解答:

由于很多要求,此题难度增加了

换个思路进行二分查找,之前一般都是对数组按照下标进行二分,现在直接按照结果进行二分,然后检查结果的正确性即可

class Solution {
public:
    int findDuplicate(vector<int>& nums) {
        int n = nums.size(), i = 0, counter = 0;
        int left = 1, right = n - 1, mid = 0;

        while (left < right)
        {
            mid = left + (right - left) / 2;

            counter = 0;
            for (i = 0; i < n; ++i)
            {
                if (nums[i] <= mid)
                    ++counter;
            }

            if (counter > mid)  //当小于这个数的数目大于该数,一定在小于等于该数中有dup
                right = mid;
            else 
                left = mid + 1;
        }

        return right;
    }
};
此时复杂度为nlogn,空间复杂度为O(1)

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值