问题描述:
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).
示例一:
Input: [3, 2, 1]
Output: 1
Explanation: The third maximum is 1.
示例二:
Input: [1, 2]
Output: 2
Explanation: The third maximum does not exist, so the maximum (2) is returned instead.
示例三:
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.
问题来源:Third Maximum Number(详细地址:https://leetcode.com/problems/third-maximum-number/description/)
思路分析:题目说的很明显了,要找的是第三大的数,在这使用三个Integer类型的变量first,second,third,初值都赋为null,一次遍历数组中的元素,如果first 为null为空或者该数大于first的话,那该数就是最大的了,赋于fisrt,然后原来的first变成了second,原来的second变成了third;如果该数小于first,接着判断它是不是比second大,然后规则和first是一样的,只是现在只需要变化second和third三个变量了;同理比第二个数小但比第三大的数要大,则它就是现在第三大的了,赋值给third。最后说一下,遇到重复的数字的时候,我们不能使用“==”等号,而应该使用equals()比较妥当,这样不会出现空指针异常,而且比较的还是真实的数字的大小。
代码: