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]
public class Solution {
public IList<int> FindDuplicates(int[] nums) {
var result = new List<int>();
for(int i=0;i<nums.Length;i++){
var index = Math.Abs(nums[i])-1;
if(nums[index]<0){
result.Add(Math.Abs(index+1));
}
nums[index]=nums[index]*-1;
}
return result;
}
}Time Complexity: O(n)
Space Complexity: O(1)
