LeetCode-414.Third Maximum Number

414. 第三大的数

Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).
给定一个非空数组，返回此数组中第三大的数。如果不存在，则返回数组中最大的数。要求算法时间复杂度必须是O(n)。
Example 1:

Input: [3, 2, 1]

Output: 1

Explanation: The third maximum is 1.

Example 2:

Input: [1, 2]

Output: 2

Explanation: The third maximum does not exist, so the maximum (2) is returned instead.

Example 3:

Input: [2, 2, 3, 1]

Output: 1

Explanation: Note that the third maximum here means the third maximum distinct number.
Both numbers with value 2 are both considered as second maximum.

Solution

利用Set去重，SortedSet可以一直储存数组中最大的三个数

using System.Collections.Generic;
public class Solution {
    public int ThirdMax(int[] nums) {
        if(nums == null ||nums.Length == 0 ){
            return 0;
        }
        var threeMaxSet = new SortedSet<int>();
        foreach(var tempNumber in nums){
            threeMaxSet.Add(tempNumber);
            if(threeMaxSet.Count > 3){
                threeMaxSet.Remove(threeMaxSet.Min);
            }
        }
        if(threeMaxSet.Count < 3){
            return threeMaxSet.Max;
        }else{
            return threeMaxSet.Min;
        }
    }
}