尋找數組中第二大的數_代碼實現

#include <iostream>#include <cstdio>using namespace std;int find_second_max(const int* data,const int count){if (!count || count == 1)return -1;int maxVal = data[0] > data[1] ? data[0] : data[1];int smaxVal = data[0] + data[1] - maxVal;for (int i = 0;i < count;i++){if (data[i] > maxVal){smaxVal = maxVal;maxVal = data[i];}else if (data[i] < maxVal && data[i] > smaxVal)smaxVal = data[i];}return smaxVal;}int main(){freopen("input.txt","r",stdin);int n;while (cin >> n){int num[n];for (int i = 0;i < n;i++)cin >> num[i];int smax = find_second_max(num,n);cout << smax << endl;}}