Leetcode 414 第三大的数

class Solution {
public:
    const long long Min = -(1LL << 31);
    int thirdMax(vector<int> &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;
    }
};

我甚至懒得看题目,代码也是一眼偷@编程熊

猜你喜欢

转载自blog.csdn.net/qq_37637818/article/details/121509325