LeetCode : Find All Numbers Disappeared in an Array
来源:互联网 发布:苹果手机称重软件 编辑:程序博客网 时间:2024/06/05 22:45
给定一个长度为
思路
数组中的每个元素都表示一个数组中的位置,遍历第一遍数组:将每个元素对应位置的数值标记为负;遍历第二遍数组:元素为正的位置编号是没有出现的元素。
Solution
vector<int> findDisappearedNumbers(vector<int>& nums){ vector<int> result; for (int i = 0; i < nums.size(); i++) { int val = abs(nums[i]) - 1; if (nums[val] > 0) nums[val] = -nums[val]; } for (int i = 0; i < nums.size(); i++) if (nums[i] > 0) result.push_back(i + 1); return result;}
0 0
- leetcode 448Find All Numbers Disappeared in an Array (array)
- LeetCode-Array-448. Find All Numbers Disappeared in an Array
- LeetCode OJ|Array|Find All Numbers Disappeared in an Array
- LeetCode OJ|Array| Find All Numbers Disappeared in an Array
- LeetCode刷题【Array】 Find All Numbers Disappeared in an Array
- [LeetCode]Find All Numbers Disappeared in an Array
- leetcode:448. Find All Numbers Disappeared in an Array
- LeetCode 448. Find All Numbers Disappeared in an Array
- LeetCode No.448 Find All Numbers Disappeared in an Array
- LeetCode Find All Numbers Disappeared in an Array
- <leetcode>448.Find All Numbers Disappeared in an Array
- leetcode: Find All Numbers Disappeared in an Array
- leetcode-448 Find All Numbers Disappeared in an Array
- [LeetCode]Find All Numbers Disappeared in an Array
- [LeetCode] 448. Find All Numbers Disappeared in an Array
- [Leetcode] Find All Numbers Disappeared in an Array
- 【LeetCode-448】 Find All Numbers Disappeared in an Array(C++)
- leetcode 448 Find All Numbers Disappeared in an Array C++
- Runtime基本知识点以及应用场景
- AlexNet学习笔记-论文翻译和理解(二)
- 论转换器是定义成接口,然后用具体类实现,还是定义成一个静态方法:
- hadoop环境配置过程中可能遇到问题的解决方案
- 认识java中的Queue:
- LeetCode : Find All Numbers Disappeared in an Array
- 模拟:
- 欢迎使用CSDN-markdown编辑器
- github入门到上传本地项目
- 从不同的视角看,相同的对象可以是不同的角色:
- 粒度的理解和应用:
- android线程中更新UI的三种方法 Demo
- 搭建网站---申请配置云服务器(-)
- 做正确的事,做正确的思考:如何形成一个解决方案: