【Leetcode-easy-448】Find All Numbers Disappeared in an Array
来源:互联网 发布:八种调度算法 编辑:程序博客网 时间:2024/06/16 14:29
【Leetcode-easy-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 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]
思路
充分使用数组长度和数组元素大小的关系,数组元素可以作为数组的下标使用
The basic idea is that we iterate through the input array and mark elements as negative using nums[nums[i] -1] = -nums[nums[i]-1]. In this way all the numbers that we have seen will be marked as negative. In the second iteration, if a value is not marked as negative, it implies we have never seen that index before, so just add it to the return list.
程序
class Solution { /** 充分使用数组长度和数组元素大小的关系,数组元素可以作为数组的下标使用 The basic idea is that we iterate through the input array and mark elements as negative using nums[nums[i] -1] = -nums[nums[i]-1]. In this way all the numbers that we have seen will be marked as negative. In the second iteration, if a value is not marked as negative, it implies we have never seen that index before, so just add it to the return list. */ public List<Integer> findDisappearedNumbers(int[] nums) { List<Integer> list = new ArrayList<>(); for (int i = 0; i < nums.length; i ++){ int index = Math.abs(nums[i]) - 1; // 元素关联的下标 if (nums[index] > 0) nums[index] = -nums[index]; // 元素标记下标对应数字是否出现 } for (int j = 0; j < nums.length; j ++){ if (nums[j] > 0) list.add(j+1); } return list; }}
阅读全文
1 0
- 【Leetcode-easy-448】Find All Numbers Disappeared in an Array
- LeetCode 448. Find All Numbers Disappeared in an Array (Easy)
- leetcode 448Find All Numbers Disappeared in an Array (array)
- LeetCode No.448 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(C++)
- leetcode 448 Find All Numbers Disappeared in an Array C++
- Leetcode 448 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 448 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 448 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-448 Find All Numbers Disappeared in an Array
- Leetcode 448 Find All Numbers Disappeared in an Array
- 2017年3月4月无人机航空摄影总结
- 1.hadoop安装-伪分布模式
- sql server 2005 32位+64位、企业版+标准版、CD+DVD 下载地址大全
- qt TCP接收数据遇到的问题
- bzoj 1596(树形dp)
- 【Leetcode-easy-448】Find All Numbers Disappeared in an Array
- WebView加载百度网页
- 栈的基本操作和应用
- Google、亚马逊、微软和 IBM 如何把 AI 服务卖出去?
- 熊猫学猿--第二竹搭建PHP环境
- Oracel alert table 笔记
- Tomcat在Linux上的安装与配置
- Revit API改变风管及管件尺寸(2014)
- PL/SQLDeveloper配置使用说明