Leetcode 414. Third Maximum Number

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

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

0 ·

CC 4.0 BY-SA版权

Leetcode 同时被 2 个专栏收录

199 篇文章

订阅专栏

Array

54 篇文章

订阅专栏

本文介绍了一个Java程序，用于寻找数组中第三大的整数。通过三次遍历分别找到最大值、次大值和第三大值，并提供了一种返回结果的方法，以应对不同情况。

public class Solution {
    public int thirdMax(int[] nums) {
        long first = Long.MIN_VALUE,
             second = Long.MIN_VALUE,
             third = Long.MIN_VALUE;
            
        // find the maximum number first
        for (int num : nums)
            if (num > first) first = num;
        
        // find the second maximum number
        for (int num : nums) {
            if (num == first) continue;
            if (num > second) second = num;
        }
        
        // find the third maximum number
        for (int num : nums) {
            if (num == first || num == second) continue;
            if (num > third) third = num;
        }
        
        return (third == Long.MIN_VALUE) ? (int)first : (int)third;
    }
}

Java primitive data types