Leetcode- third largest number - simple

title ：414 The third largest number - Simple

subject

Give you a non empty array , Returns the value in this array The third largest number . If it doesn't exist , Then return the maximum number in the array .

Example 1

 Input ：[3, 2, 1]
 Output ：1
 explain ： The third largest number is  1 .

Example 2

 Input ：[1, 2]
 Output ：2
 explain ： The third largest number doesn't exist ,  So return the maximum number  2 .

Example 3

 Input ：[2, 2, 3, 1]
 Output ：1
 explain ： Be careful , Ask to return the third largest number , It's the third largest of all the different numbers .
 There are two values in this example that are  2  Number of numbers , They're both second . The third largest of all the different numbers is 

Tips

• 1 <= nums.length <= 104
• -231 <= nums[i] <= 231 - 1

Code Java

public int thirdMax(int[] nums) {
    
    long first = Long.MIN_VALUE;
    long second = Long.MIN_VALUE;
    long third = Long.MIN_VALUE;
    for (int i = 0; i < nums.length; i++) {
    
        if (first < nums[i]) {
    
            third = second;
            second = first;
            first = nums[i];
        } else if (second < nums[i] && nums[i] < first) {
    
            third = second;
            second = nums[i];
        } else if (third < nums[i] && nums[i] < second) {
    
            third = nums[i];
        }
    }
    if (third == Long.MIN_VALUE)
        return (int) first;
    return (int) third;
}