博乐科技一面（还没后续）

class solution
{
public:
    vector<int> findSecondNum(vector<int> arr)
    {
        int firMin,secondMin;
        if(arr[0] < arr[1])
        {
            firMin = arr[0];
            secondMin = arr[1];
        }
        else
        {
            secondMin = arr[0];
            firMin = arr[1];
        }
        for(int i = 2;i < arr.size();i++)
        {
            if(arr[i] < secondMin)
            {
                if(arr[i] < firMin)
                {
                    secondMin = firMin;
                    firMin = arr[i];
                }
                else
                {
                    secondMin = arr[i];
                }
            }
        }
        return secondMin;
    }
}