LeetCode Find All Duplicates in an Array

题意：在数组元素为1-n的数组中找到出现两次的数

思路：遍历时，将元素对应的数取负数，如果对应的数据为负数，说明重复

代码如下：

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

LeetCode Find All Duplicates in an Array相关推荐

LeetCode 26 Remove Duplicates from Sorted Array [Array/std::distance/std::unique] c++
LeetCode 26 Remove Duplicates from Sorted Array [Array/std::distance/std::unique] <c++> 给出排序好的 ...
Leetcode OJ: Remove Duplicates from Sorted Array I/II
删除排序数组重复元素,先来个简单的. Remove Duplicates from Sorted Array Given a sorted array, remove the duplicates i ...
LeetCode 80. Remove Duplicates from Sorted Array II
80. Remove Duplicates from Sorted Array II My Submissions QuestionEditorial Solution Total Accepted: ...
【leetcode】Remove Duplicates from Sorted Array
题目:Given a sorted array, remove the duplicates in place such that each element appear only once and ...
LeetCode之Remove Duplicates from Sorted Array II
1.题目 Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For ...
LeetCode之Remove Duplicates from Sorted Array
1.题目 Given a sorted array, remove the duplicates in place such that each element appear only once an ...
LeetCode 26. Remove Duplicates from Sorted Array
题目: Given a sorted array, remove the duplicates in place such that each element appear only once and ...
leetcode:2680 Remove Duplicates from Sorted Array 删除数组中的重复元素
leetcode:26 对数组元素进行去重,使得原数组重复元素最多保留1个限制: 我们不可以额外分配数组,必须保持空间复杂度为O(1) 这个并不难实现: class Solution(object) ...
leetCode #26 Remove Duplicates from Sorted Array
删除相同数字 1 class Solution { 2 public: 3 int removeDuplicates(vector<int>& nums) { 4 int coun ...

LeetCode Find All Duplicates in an Array

LeetCode Find All Duplicates in an Array相关推荐

最新文章

热门文章