Given an integer array, nums, of length $n$, where all the integers of nums are in the range $[1, n]$ and each integer appears once or twice, return an array of all the integers that appear twice.

Note: Write an algorithm that runs in $O(n)$ ...