287. Find the Duplicate Number
来源:互联网 发布:贵州大数据平台 编辑:程序博客网 时间:2024/06/03 12:30
题目:
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.
public class Solution { public int findDuplicate(int[] nums) { int ans = 0; for(int i=0;i<nums.length;i++){ for(int j=0;j<nums.length;j++){ if(nums[i]==nums[j]&&i<j){ ans = nums[j]; break; } } } return ans; }}
自己做出来的
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
- unity的monoBebavior 函数时序
- 紫光为什么看重LATTICE的FPGA
- loadrunner第一次实践
- 第六章
- Android自定义控件-彩色进度条
- 287. Find the Duplicate Number
- html导航框架简析
- AngularJS 监听变量变化
- 南阳理工ACM 题目105 九的余数
- 固定高度的div在屏幕中居中方法
- 害死人不偿命的(3n+1)猜想
- Spring cloud monitor 自定义通知方式
- 动态规划练习一 19:最低通行费
- windows7更新出错