[LeetCode] 448. Find All Numbers Disappeared in an

Scorpion 发布于2019-08-16 13:39 / 793人阅读

Problem

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]

Solution

class Solution {
    public List findDisappearedNumbers(int[] nums) {
        List res = new ArrayList<>();
        for (int i = 0; i < nums.length; i++) {
            int val = Math.abs(nums[i])-1;
            if (nums[val] > 0) nums[val] = -nums[val];
        }
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] > 0) res.add(i+1);
        }
        return res;
    }
}

GPU云服务器云服务器 FIND_IN_SET Disappeared Numbers LeetCode

文章版权归作者所有，未经允许请勿转载,若此文章存在违规行为，您可以联系管理员删除。

转载请注明本文地址：https://www.ucloud.cn/yun/72092.html

[LeetCode] 448. Find All Numbers Disappeared in an

Problem 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...

X_AirDu 2019-08-16 14:28 评论0 收藏0
leetcode 448 Find All Numbers Disappeared in an Ar

摘要：如果这个位置的值为正意味着我们还没有对这个元素进行过操作，我们将这个位置的元素的值取负。在整个遍历结束后，没有取负的值的索引，就可以对应到没有在数组出现过的值解法题目详情 Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others ap...

MoAir 2019-08-15 13:54 评论0 收藏0
leetcode448. Find All Numbers Disappeared in an Ar

摘要：题目要求假设一个长度为的整数数组，数组中的元素的值位于区间中。代码如下但是这个实现违背了的空间复杂度这里结果集不视为额外空间。如果当前元素无需进行交换，则指针右移一位。无需进行的场景是指当前元素已经出现在目标位置上了。题目要求 Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some element...

blankyao 2019-08-16 17:09 评论0 收藏0
448. Find All Numbers Disappeared in an Array

摘要：题目链接一般这种类型的题要，要么给赋值成不在范围内的数，要么到对应位置。 448. Find All Numbers Disappeared in an Array 题目链接：https://leetcode.com/problems... 一般这种类型的题要in place，要么给num[i]赋值成不在范围内的数，要么swap到对应位置。 public class Solution ...

DevWiki 2019-08-14 17:28 评论0 收藏0
Leetcode PHP题解--D79 448. Find All Numbers…

摘要：题目链接题目分析给定一个到的数组，返回其中缺失的数字。思路用得出到的数字，再用和给定的数组计算差集。最终代码若觉得本文章对你有用，欢迎用爱发电资助。 D79 448. Find All Numbers Disappeared in an Array 题目链接 448. Find All Numbers Disappeared in an Array 题目分析给定一个1到n的数组，返回...

X1nFLY 2019-07-01 13:57 评论0 收藏0