Find All Numbers Disappeared in an Array

原创 2017年01月03日 20:05:56

题目描述:

LeetCode 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]


解题思路:

采用桶排序

code

public class Solution {
    public List<Integer> findDisappearedNumbers(int[] nums) {
        List<Integer> list = new ArrayList<Integer>();
	if(nums == null || nums.length == 0)
            return list;
        int n = nums.length;
        int [] returnedArray = new int[n];
        int i = 0;
        for(i = 0;i<n;i++){
            returnedArray[nums[i]-1]++;
        } 
        for(i = 0;i<n;i++){
            if(returnedArray[i] == 0){
                list.add(i+1);
            }
        }
        return list;
    }
}
其他方法参考:http://blog.csdn.net/qq_30351805/article/details/53125837

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

LeetCode 448. Find All Numbers Disappeared in an Array

448. Find All Numbers Disappeared in an Array
  • peisir
  • peisir
  • 2017年07月21日 10:56
  • 87

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 (Java)

Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and ot...
  • NOadu
  • NOadu
  • 2017年06月11日 13:14
  • 123

【Leetcode】448. Find All Numbers Disappeared in an Array

448. Find All Numbers Disappeared in an Array Given an array of integers where 1 ≤ a[i] ≤ n (n ...

LeetCode [448. Find All Numbers Disappeared in an Array] 难度[easy]

LeetCode [448. Find All Numbers Disappeared in an Array] 难度[easy]题目Given an array of integers where ...

LeetCode--448. Find All Numbers Disappeared in an Array

448. Find All Numbers Disappeared in an Array 题目描述: Given an array of integers where 1 ≤ a[i] ≤ n ...
  • BestFSQ
  • BestFSQ
  • 2017年02月25日 09:48
  • 231

leetcode448. Find All Numbers Disappeared in an Array

448. Find All Numbers Disappeared in an ArrayGiven an array of integers where 1 ≤ a[i] ≤ n (n = size...

LeetCode 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 ot...

448. Find All Numbers Disappeared in an Array \ 414. Third Maximum Number

448法一:class Solution { public: vector findDisappearedNumbers(vector& nums) { int nums_le...

leetcode 448. Find All Numbers Disappeared in an Array

leetcode 448. Find All Numbers Disappeared in an ArrayQuestionGiven an array of integers where 1 ≤ a...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Find All Numbers Disappeared in an Array
举报原因:
原因补充:

(最多只允许输入30个字)