leetcode （Find All Numbers Disappeared in an Array）

Title：Find All Numbers Disappeared in an Array） 448

Difficulty：Easy

原题leetcode地址：https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/

1. 见代码中的注释讲解

时间复杂度：O(n)，两次for循环，但都是一层，最长的for循环需要遍历整个数组的长度。

空间复杂度：O(1)，没有申请额外。

    /*** 第一次for循环数组中每个元素对应的位置加（nums的长度+1），*      没有出现的数对应的位置上的数不会加（nums的长度+1）*      重复出现的数对应的位置上的数会加上（nums的长度+1）的次数就是出现的次数（如果求重复出现的数的次数就是...）* 第二次for循环，将第一次for循环之后的数整除（nums的长度+1），*      如果结果为0，则是没有出现的数*      如果结果为1，则是出现一次的数*      如果结果为2，则是出现两次的数，依次类推* @param nums* @return*/public static List<Integer> findDisappearedNumbers(int[] nums) {List<Integer> list = new ArrayList<>();for (int i = 0; i < nums.length; i++) {nums[nums[i] % (nums.length + 1) - 1] += nums.length + 1;}for (int i = 0; i < nums.length; i++) {if (nums[i] % (nums.length + 1) == 0) {list.add(i + 1);}}return list;}

leetcode （Find All Numbers Disappeared in an Array）相关推荐

C#LeetCode刷题之#448-找到所有数组中消失的数字（Find All Numbers Disappeared in an Array）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3712 访问. 给定一个范围在 1 ≤ a[i] ≤ n ( n ...
Leetcode 448. Find All Numbers Disappeared in an Array
Leetcode 448. Find All Numbers Disappeared in an Array Add to List Description Submission Solutions ...
LeetCode 448. Find All Numbers Disappeared in an Array 442. Find All Duplicates in an Array
这两道题很有意思,由于元素为1~n,因此每个元素的值-1(映射到0~n-1)就可以直接当做下标.这样将 nums 中对应下标的元素 *-1 以i表示 index+1 这个元素出现过了,能节省存储的空间 ...
leetcode 448. Find All Numbers Disappeared in an Array | 448. 找到所有数组中消失的数字（原地，位运算）
题目 https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/ 题解遍历数组,将数组中每个数字 n 作为下标,将 ...
LeetCode之Find All Numbers Disappeared in an Array
1.题目 Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice a ...
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 ...
[swift] 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 ...
Find All Numbers Disappeared in an Array
Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others ...
LeetCode（Sorting) 2089Find Target Indices After Sorting Array
1.问题 You are given a 0-indexed integer array nums and a target element target. A target index is an ...
[LeetCode] 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 ...

leetcode （Find All Numbers Disappeared in an Array）

leetcode （Find All Numbers Disappeared in an Array）相关推荐

最新文章

热门文章