414. Third Maximum Number

最新推荐文章于 2024-07-10 23:03:37 发布

原创最新推荐文章于 2024-07-10 23:03:37 发布 · 223 阅读

0 ·

CC 4.0 BY-SA版权

leetcode习题笔记专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一种高效查找数组中第三大唯一数值的方法，并提供了一个Java实现案例，通过使用Set数据结构来过滤重复值并找到第三大的数。

Description: 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.

解题思路

这道题可以利用Set来完成，先将Array中的元素加到Set中，再将Set的前两个最大值移除即可。

Java-Solution:

public class Solution {
    public int thirdMax(int[] nums) {
        Set<Integer> distinct = new HashSet<Integer>();
        for(int i = 0; i < nums.length; i++){
            distinct.add(nums[i]);
        }
        if(distinct.size() <= 2)  return Collections.max(distinct);
        int count = 3;
        int thirdMax = Integer.MIN_VALUE;
        while(count > 0){
            int max = Collections.max(distinct);
            distinct.remove(max);
            thirdMax = max;
            count--;
        }
        return thirdMax;
    }
}