414. Third Maximum Number

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

林下溪源

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

阅读量73

点赞数

分类专栏： LeetCode # Arrays 文章标签： LeetCode 算法 Java

本文链接：https://blog.csdn.net/zzyy17/article/details/103037226

版权

LeetCode 同时被 2 个专栏收录

117 篇文章 0 订阅

订阅专栏

Arrays

79 篇文章 0 订阅

订阅专栏

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

Analysis:

本题使用三个变量保存每次的遍历值。代码如下：

Code:

class Solution {
    public int thirdMax(int[] nums) {
        Integer maxF = null;
        Integer maxS = null;
        Integer maxT = null;
        for(Integer ans : nums) {
            if (ans.equals(maxF) || ans.equals(maxS) || ans.equals(maxT)) continue;
            if (maxF == null || ans > maxF) {
                maxT = maxS;
                maxS = maxF;
                maxF= ans;
            } else if (maxS == null || ans > maxS) {
                maxT = maxS;
                maxS = ans;
            } else if (maxT == null || ans > maxT) {
                maxT = ans;
            }
        }
        return maxT == null ? maxF : maxT;
    }
}