第二大的数

//第二大的数
int secondMaxNumber(vector<int>& v){
    assert(v.size() >= 2);
    int max;
    int secondMax;
    if (v[0] > v[1]){
        max = v[0];
        secondMax = v[1];
    }
    else{
        max = v[1];
        secondMax = v[0];
    }
    int len = v.size();
    for (int i = 2; i < len; ++i){
        if (v[i] > secondMax){
            if (v[i] > max){
                secondMax = max;
                max = v[i];
            }
            else{
                secondMax = v[i];
            }
        }
    }
    return secondMax;
}


int main(){
    vector<int> v{ 1, 4, 23, 76, 0, -91 };
    cout << secondMaxNumber(v) << endl; 
    return 0;
}