Leetcode 448. Find All Numbers Disappeared in an Array
Leetcode 448. Find All Numbers Disappeared in an Array
Description Submission Solutions
- Total Accepted: 31266
- Total Submissions: 58997
- Difficulty: Easy
- Contributors: yuhaowang001
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements of [1, n] inclusive that do not appear in this array.
Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.
Example:
Input: [4,3,2,7,8,2,3,1]Output: [5,6]
Subscribe to see which companies asked this question.
题解：
（1）， 不能申请额外的空间， 只能在原数组进行swap操作了。
（2）， 根据数据的类型，大小都是处于 [1, n], 进行位置操作。
class Solution {
public:vector<int> findDisappearedNumbers(vector<int>& nums) {vector<int> ans;int i = 0; while(i<nums.size()){if(nums[i] != nums[ nums[i]-1 ]){swap(nums[i], nums[ nums[i]-1 ] ); }else{++i; }}for(int i=0; i<nums.size(); ++i){if(nums[i] != i+1){ans.push_back( i+1 ); }}return ans; }
};
转载于:https://www.cnblogs.com/zhang-yd/p/6528014.html
Leetcode 448. Find All Numbers Disappeared in an Array相关推荐
- LeetCode 448. Find All Numbers Disappeared in an Array 442. Find All Duplicates in an Array
这两道题很有意思,由于元素为1~n,因此每个元素的值-1(映射到0~n-1)就可以直接当做下标.这样将 nums 中对应下标的元素 *-1 以i表示 index+1 这个元素出现过了,能节省存储的空间 ...
- leetcode 448. Find All Numbers Disappeared in an Array | 448. 找到所有数组中消失的数字（原地，位运算）
题目 https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/ 题解 遍历数组,将数组中每个数字 n 作为下标,将 ...
- leetcode 448. Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and ot ...
- [swift] LeetCode 448. Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and ot ...
- LeetCode之Find All Numbers Disappeared in an Array
1.题目 Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice a ...
- 448. Find All Numbers Disappeared in an Array(找到所有数组中消失的数字)
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and ot ...
- 448. Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and ot ...
- 448. Find All Numbers Disappeared in an Array 寻找有界数组[1,n]中的缺失数
［抄题］: Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice ...
- 448. Find All Numbers Disappeared in an Array645. Set Mismatch
题目: 448. Find All Numbers Disappeared in an Array Given an array of integers where 1 ≤ a[i] ≤ n (n = ...
最新文章
- Windows 曝漏洞 —— 影响所有版本
- 准备重新回归信息安全产业
- Spring事务传播属性和隔离级别
- 华为p20pro投屏到笔记本_新荣耀笔记本与微软系统合作，网友：一碰即传投屏功能还有吗...
- 开启Github之旅
- pdf转换成ppt转换器免费版
- ENVI53 辐射校正、大气校正、影像裁剪超详细教程
- 苹果库乐队怎么玩_苹果手机使用技巧（例iPhone11）
- 二手车数据挖掘- 数据分析
- CSAPP Bomb Lab
- ᑋᵉᑊᑊᵒ ᵕ̈ᰔᩚ
- POI单元格合并（合并后边框空白修复）、自动列宽、水平居中、垂直居中、设置背景颜色、设置字体等常见问题
- 题目内容： 你的程序要读入一个整数，范围是[-100000,100000]。然后，用汉语拼音将这个整数的每一位输出出来。 如输入1234，则输出： yi er san si 注意，每个字的拼音
- VISUAL SVN安装 及客户端使用
- mixly for linux64,Mixly编程for Linux
- mysql数据库备份工具
- 锁相环的组成和原理及应用
- AXI总线学习（AXI34）
- Android游戏框架AndEngine使用入门
- mysql主从三个线程工作顺序_MySQL主从介绍、准备工作、配置主、配置从、测试主从同步...