414. Third Maximum Number && 第n大数求解策略

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).

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.

==分析: 求第3大的数，可以延伸出求第n大的数。若n=2，3，4比较小的数，可以采取设置几个数据来记录下这几个数，遍历一遍数组就好，我这里主要想说一下求第n大个数的策略，比如n个数组求第n/3大的数。==

策略一：将数组进行排序，即可方便的拿出第n大的数，时间复杂度$O(nlogn)$

策略二：选择排序。选择排序第K次将最大的数给找出来，时间复杂度$O(n*K)$

策略三：堆排序。从顶拿K次即可。时间复杂度$O(n+log*k)$，建堆时间为$O(n)$

策略四：快速排序。从数组S中随机找出一个元素X，把数组分为两部分Sa和Sb。Sa中的元素大于等于X，Sb中元素小于X。

class Solution {
    public int thirdMax(int[] nums) {
        Integer max1 = null;
        Integer max2 = null;
        Integer max3 = null;
        for(Integer num:nums){
            if(num.equals(max1)||num.equals(max2)||num.equals(max3)) continue;
            if(max1 == null || num>max1){
                max3 = max2;
                max2 = max1;
                max1 = num;
            }else if(max2 == null || num>max2){
                max3 = max2;
                max2 = num;
            }else if(max3 == null || num>max3){
                max3 = num;
            }

        }
        return max3 == null ? max1:max3;
    }
}