[LeetCode] 448. Find All Numbers Disappeared in an

Scorpion 發(fā)布于2019-08-16 13:39 / 900人閱讀

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;
    }
}

云服務(wù)器 GPU云服務(wù)器 FIND_IN_SET Disappeared Numbers LeetCode

文章版權(quán)歸作者所有，未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉(zhuǎn)載請(qǐng)注明本文地址：http://m.hztianpu.com/yun/72092.html

相關(guān)文章

[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 評(píng)論0 收藏0
leetcode 448 Find All Numbers Disappeared in an Ar

摘要：如果這個(gè)位置的值為正意味著我們還沒(méi)有對(duì)這個(gè)元素進(jìn)行過(guò)操作，我們將這個(gè)位置的元素的值取負(fù)。在整個(gè)遍歷結(jié)束后，沒(méi)有取負(fù)的值的索引，就可以對(duì)應(yīng)到?jīng)]有在數(shù)組出現(xiàn)過(guò)的值解法題目詳情 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 評(píng)論0 收藏0
leetcode448. Find All Numbers Disappeared in an Ar

摘要：題目要求假設(shè)一個(gè)長(zhǎng)度為的整數(shù)數(shù)組，數(shù)組中的元素的值位于區(qū)間中。代碼如下但是這個(gè)實(shí)現(xiàn)違背了的空間復(fù)雜度這里結(jié)果集不視為額外空間。如果當(dāng)前元素?zé)o需進(jìn)行交換，則指針右移一位。無(wú)需進(jìn)行的場(chǎng)景是指當(dāng)前元素已經(jīng)出現(xiàn)在目標(biāo)位置上了。題目要求 Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some element...

blankyao 2019-08-16 17:09 評(píng)論0 收藏0
448. Find All Numbers Disappeared in an Array

摘要：題目鏈接一般這種類型的題要，要么給賦值成不在范圍內(nèi)的數(shù)，要么到對(duì)應(yīng)位置。 448. Find All Numbers Disappeared in an Array 題目鏈接：https://leetcode.com/problems... 一般這種類型的題要in place，要么給num[i]賦值成不在范圍內(nèi)的數(shù)，要么swap到對(duì)應(yīng)位置。 public class Solution ...

DevWiki 2019-08-14 17:28 評(píng)論0 收藏0
Leetcode PHP題解--D79 448. Find All Numbers…

摘要：題目鏈接題目分析給定一個(gè)到的數(shù)組，返回其中缺失的數(shù)字。思路用得出到的數(shù)字，再用和給定的數(shù)組計(jì)算差集。最終代碼若覺得本文章對(duì)你有用，歡迎用愛發(fā)電資助。 D79 448. Find All Numbers Disappeared in an Array 題目鏈接 448. Find All Numbers Disappeared in an Array 題目分析給定一個(gè)1到n的數(shù)組，返回...

X1nFLY 2019-07-01 13:57 評(píng)論0 收藏0