LeetCode-448. Find all Numbers disappeared in an Array

Source: Internet
Author: User

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 The does not appear in this array.

Could do it without extra space and in O (n) runtime? Assume the returned list does not count as extra space.



 Public classSolution { PublicList<integer> Finddisappearednumbers (int[] nums) {List<Integer> arr =NewArraylist<integer>(); if(Nums = =NULL)            returnarr;  for(inti=0; i<nums.length; i++) {            intindex = ABS (Nums[i])-1; if(Nums[index] > 0) Nums[index]= -Nums[index]; }         for(inti=0; i<nums.length; i++) {            if(Nums[i] > 0) Arr.add (i+1); }        returnarr; }         Public intAbsintN) {returnN < 0? -N. }       }

LeetCode-448. Find all Numbers disappeared in an Array

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.