2148. Count Elements With Strictly Smaller and Greater Elements

제목

문제)

2148. Count Elements With Strictly Smaller and Greater Elements

 

Given an integer array nums, return the number of elements that have both a strictly smaller and a strictly greater element appear in nums.

 

Example 1:

Input: nums = [11,7,2,15]
Output: 2
Explanation: The element 7 has the element 2 strictly smaller than it and the element 11 strictly greater than it.
Element 11 has element 7 strictly smaller than it and element 15 strictly greater than it.
In total there are 2 elements having both a strictly smaller and a strictly greater element appear in nums.

Example 2:

Input: nums = [-3,3,3,90]
Output: 2
Explanation: The element 3 has the element -3 strictly smaller than it and the element 90 strictly greater than it.
Since there are two elements with the value 3, in total there are 2 elements having both a strictly smaller and a strictly greater element appear in nums.

 

Constraints:

• 1 <= nums.length <= 100
• -105 <= nums[i] <= 105

솔루션1)

- 오름차순 정렬 후 배열을 순회하면서 해당 element가 양 끝단 값 사이에 있는지 체크

class Solution:
    def countElements(self, nums: List[int]) -> int:
        if len(nums) < 3:
            return 0
        nums.sort()
        
        count = 0
        for i in range(1, len(nums)-1):
            if nums[0] < nums[i] < nums[-1]:
                count += 1
        return count

솔루션2)

- 솔루션1을 정렬없이 코드 수정

class Solution:
    def countElements(self, nums: List[int]) -> int:
        min_val = min(nums)
        max_val = max(nums)
        return sum([1 for n in nums if min_val < n < max_val])