Neither Minimum nor Maximum | LeetCode 2733 | C

2023-08-30
#LeetCode #C #Array
LeetCode

Given an integer array nums containing distinct positive integers, find and return any number from the array that is neither the minimum nor the maximum value in the array, or -1 if there is no such number.

Return the selected integer.

Example 1:

1
2
3
Input: nums = [3,2,1,4]
Output: 2
Explanation: In this example, the minimum value is 1 and the maximum value is 4. Therefore, either 2 or 3 can be valid answers.

Example 2:

1
2
3
Input: nums = [1,2]
Output: -1
Explanation: Since there is no number in nums that is neither the maximum nor the minimum, we cannot select a number that satisfies the given condition. Therefore, there is no answer.

Example 3:

1
2
3
Input: nums = [2,1,3]
Output: 2
Explanation: Since 2 is neither the maximum nor the minimum value in nums, it is the only valid answer.

Constraints:

1
2
3
1 <= nums.length <= 100
1 <= nums[i] <= 100
All values in nums are distinct

Approach

1
Go through the list and find the max and min value. Finally exclude the max and min values and you can get the "neither min nor max value".

Algorithm

1
2
1. Go through the list and find the max and min value.
2. Go through the list again to find the "neither min nor max value".

Implementation

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
int findNonMinOrMax(int* nums, int numsSize){
    int max = 1;
    int min = 100;
    int index = 0;
    if(numsSize <=2)
        return -1;
    for(int i=0;i<numsSize;i++)
    {
        if(nums[i]<min)
            min = nums[i];
        if(nums[i]>max)
            max = nums[i];
    }
    while(1){
        if(nums[index]!=min && nums[index]!=max)
            break;
        index++;
    }
    return nums[index];
}