#include <bits/stdc++.h>
int findSecondLargest(int n, std::vector<int> &arr) {
if (n <= 1) return -1;
int secondLargest = INT_MIN;
int Largest = INT_MIN;
for (int i = 0; i < n; i++)
{
if (arr[i] > Largest)
{
secondLargest = Largest;
Largest = arr[i];
}
else if (arr[i] > secondLargest && arr[i] < Largest)
{
secondLargest = arr[i];
}
}
if (secondLargest == INT_MIN) return -1;
return secondLargest;
}
Comments
Post a Comment