287. Find the Duplicate Number
来源:互联网 发布:eclipse php 编辑:程序博客网 时间:2024/06/17 00:43
题目:
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:
- You must not modify the array (assume the array is read only).
- You must use only constant, O(1) extra space.
- Your runtime complexity should be less than
O(n2)
. - There is only one duplicate number in the array, but it could be repeated more than once.
代码:
class Solution {
public:
int findDuplicate(vector<int>& nums) {
int n=nums.size()-1;
int low=1;
int high=n;
int mid;
while(low<high){
mid=(low+high)/2;
int count=0;
for(int num = 0;num<nums.size();num++){
if(nums[num]<=mid) count++;
}
if(count>mid) high=mid;
else low=mid+1;
}
return low;
}
};
阅读全文
0 0
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287.Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- 287. Find the Duplicate Number
- webpack---Error in app.js ;Module build failed :SyntaxError ../app.js : unpexted token <7:8> 对'<'报错
- 梯度下降
- 复习一:分治算法
- 《CLR via C#》读书笔记---10属性
- ListView拓展-下拉刷新,顶部图片放大效果
- 287. Find the Duplicate Number
- Android基于Java反射机制的简单ORM-Dao层
- MVC5.0 怎么会数据库中的html标签读取到页面上????
- C#服务器端与客户端的通信(服务器端)
- Java零基础学习日记-配置jdk环境
- cygwin小记
- 计算机网络常考面试题
- JaveScript之DOM
- 算法分析与设计课程16——376. Wiggle Subsequence