448. Find All Numbers Disappeared in an Array
来源:互联网 发布:avmoo最新域名2016 8 编辑:程序博客网 时间:2024/06/03 20:46
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]
public class Solution { public List<Integer> findDisappearedNumbers(int[] nums) {List<Integer> res = new ArrayList<Integer>(); int n = nums.length; for (int i = 0; i < nums.length; i ++) nums[(nums[i]-1) % n] += n; for (int i = 0; i < nums.length; i ++) if (nums[i] <= n) res.add(i+1); return res; }}
0 0
- LeetCode-Array-448. Find All Numbers Disappeared in an Array
- [LC][Array] 448. Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- Find All Numbers Disappeared in an Array
- 448. Find All Numbers Disappeared in an Array
- 448. Find All Numbers Disappeared in an Array
- 448. Find All Numbers Disappeared in an Array
- leetcode:448. Find All Numbers Disappeared in an Array
- cs231n笔记1
- linux串口编程说明
- Java中的常用异常处理方法
- Exception in thread "main" java.lang.UnsatisfiedLinkError: Cannot load 32-bit SWT libraries on 64-bi
- Hibernate 一对多注解 mappedby 作用
- 448. Find All Numbers Disappeared in an Array
- 各种滤波原理
- 3DGIS第四章 视点相关的实时选择性细化
- Spring boot上配置与使用mybatis plus
- 8大排序算法图文讲解
- Support V4 包大拆分
- centos急速搭建lamp
- 分组的自定义流布局方法一
- AfxBeginThread创建线程并指定优先级