Removing repeats from a sorted array

An array is sorted in increasing order and may contain repeated values. How do you extract the list of distinct values?

One pass comparing each element with the previous one: $O(n)$ time. Because equal values sit next to each other, keep an element only when it differs from the last value kept. It can be done in place with a write index, using $O(1)$ extra space.