解题思路:
首先定义一个数组top3[3] = {INT_MIN, INT_MIN, INT_MIN},由左至右,分别存储第一大,第二大,第三大元素
然后,遍历数组,对于每一个数,找到其在top3中的位置。
以下代码中,shiftCount表示能够加入到top3[3]数组中元素的个数。开始时,top3中没有数组中的元素,第一个加入进去,shiftCount=1, 如果出现一个与第一个不同的数,它有两个可能的位置,shiftCount==2, 出现第三个不同的数,shiftCount=3
当shiftCount>=3时,存在第三大元素,否则就返回最大元素
原题目:
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.
AC解,C++代码,菜鸟一个,请大家多多指正
class Solution {
public:
int thirdMax(vector<int>& nums) {
int top3[3] = { INT_MIN, INT_MIN, INT_MIN };
int shiftCount = 0; //插入元素的个数
for (vector<int>::size_type ix = 0; ix != nums.size(); ix++) {
int top_ix;
for (top_ix = 0; top_ix < 3; top_ix++) {
if (nums[ix] >= top3[top_ix]) {
break;
}
}
if (nums[ix] == top3[top_ix] && shiftCount == top_ix) {
shiftCount++;
}
if (nums[ix] != top3[top_ix]) {
for (int j = 2; j > top_ix; j--) {
top3[j] = top3[j - 1];
}
top3[top_ix] = nums[ix];
shiftCount++;
}
}
if (shiftCount < 3) {
return top3[0];
}
else {
return top3[2];
}
}
};