leetcode448: Find All Numbers Disappeared in an Array

本文主要是介绍leetcode448: 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]

标记正负号来决定是否出现了这个数字

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

这篇关于leetcode448: Find All Numbers Disappeared in an Array的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---