leetcode448: Find All Numbers Disappeared in an Array

最新推荐文章于 2022-06-14 17:41:04 发布

UESTC_kb216

最新推荐文章于 2022-06-14 17:41:04 发布

阅读量159

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/sinat_35425429/article/details/56498957

版权

leetcode 专栏收录该内容

85 篇文章 0 订阅

订阅专栏

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