首页 > 代码库 > 442. 找出数组中重复的元素 Find All Duplicates in an ArrayGiven an array of integers
442. 找出数组中重复的元素 Find All Duplicates in an ArrayGiven an array of integers
Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements that appear twice in this array.
Could you do it without extra space and in O(n) runtime?
Example:
Input: [4,3,2,7,8,2,3,1] Output: [2,3]
题意：找出数组中重复的元素
关键：1 ≤ a[i] ≤ n 和 appear twice
解法：nums[Math.Abs(nums[i]) - 1] *= -1 如果 nums[Math.Abs(nums[i]) - 1] 小于0 则nums[i]重复
public class Solution {public IList<int> FindDuplicates(int[] nums) {List<int> list = new List<int>();for (int i = 0; i < nums.Length; i++) {nums[Math.Abs(nums[i]) - 1] *= -1;if (nums[Math.Abs(nums[i]) - 1] > 0) {list.Add(Math.Abs(nums[i]));}}return list;}}
null
442. 找出数组中重复的元素 Find All Duplicates in an ArrayGiven an array of integers
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。