
class Solution {
public:
const long long Min = -(1LL << 31);
int thirdMax(vector &nums) {
long fi = Min, se = Min, th = Min;
for (int i = 0; i < nums.size(); i++) {
if (nums[i] > fi) {
th = se;
se = fi;
fi = nums[i];
} else if (fi > nums[i] && nums[i] > se) {
th = se;
se = nums[i];
} else if (se > nums[i] && nums[i] > th) {
th = nums[i];
}
}
if (th == Min)
return fi;
return th;
}
};
欢迎分享,转载请注明来源:内存溢出
微信扫一扫
支付宝扫一扫
评论列表(0条)