LeetCode每日一题(Find the Duplicate Number)
2021/9/14 23:09:20
本文主要是介绍LeetCode每日一题(Find the Duplicate Number),对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive.
There is only one repeated number in nums, return this repeated number.
You must solve the problem without modifying the array nums and uses only constant extra space.
Example 1:
Input: nums = [1,3,4,2,2]
Output: 2
Example 2:
Input: nums = [3,1,3,4,2]
Output: 3
Example 3:
Input: nums = [1,1]
Output: 1
Example 4:
Input: nums = [1,1,2]
Output: 1
Constraints:
- 1 <= n <= 105
- nums.length == n + 1
- 1 <= nums[i] <= n
- All the integers in nums appear only once except for precisely one integer which appears two or more times.
nums[nums[i]-1] *= -1, 如果已经<0 了,则证明 nums[i]是重复的数字
代码实现(Rust):
impl Solution { pub fn find_duplicate(mut nums: Vec<i32>) -> i32 { for i in 0..nums.len() { let idx = nums[i].abs() as usize; if nums[idx-1] < 0 { return idx as i32; } nums[idx-1] *= -1; } unreachable!() } }
这篇关于LeetCode每日一题(Find the Duplicate Number)的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-06-30uniAPP 实现全屏左右滚动滚动的效果-icode9专业技术文章分享
- 2024-06-30如何在本地使用授权或插件-icode9专业技术文章分享
- 2024-06-30伪静态规则配置方法汇总-icode9专业技术文章分享
- 2024-06-29易优CMS安装常见问题汇总-icode9专业技术文章分享
- 2024-06-28易优新手必读安装教程-icode9专业技术文章分享
- 2024-06-28忘记eyoucms后台密码怎么办?-icode9专业技术文章分享
- 2024-06-26终极指南:Scrum中如何设置需求优先级
- 2024-06-26AI大模型企业应用实战(25)-为Langchain Agent添加记忆功能
- 2024-06-26小白家庭 nas 搭建方案-icode9专业技术文章分享
- 2024-06-23AI大模型企业应用实战(14)-langchain的Embedding