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:
1 2 3 4 5
Input: [3, 2, 1]
Output: 1
Explanation: The third maximum is 1.
Example 2:
1 2 3 4 5
Input: [1, 2]
Output: 2
Explanation: The third maximum does not exist, so the maximum (2) is returned instead.
Example 3:
1 2 3 4 5 6
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.
class{ publicintthirdMax(int[] nums){ int max = Integer.MIN_VALUE; int m2 = Integer.MIN_VALUE; int m3 = Integer.MIN_VALUE; boolean flag = false; for (int i = 0; i < nums.length; i++) { if (nums[i] > max) { max = nums[i]; } } for (int i = 0; i < nums.length; i++) { if (nums[i] < max && nums[i] >m2) { m2 = nums[i]; } } for (int i = 0; i < nums.length; i++) { if (nums[i] < m2 && nums[i] >= m3) { m3 = nums[i]; flag = true; } } if (flag) { return m3; } else { return max; } } }
近期评论