勇敢的心

目标设到塞德娜,即使失败,也能落到众星之间!

Find All Numbers Disappeared in an Array

题目描述:

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
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u010442136/article/details/53997390
个人分类: leetcode解题系列
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

Find All Numbers Disappeared in an Array

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭