Third Maximum Number

Return the third distinct largest value in an integer array (treat duplicate values as one); if fewer than three distinct values exist, return the maximum. The challenge is to do this in O(n) time (ideally with constant extra space).