java.lang.Object
g2401_2500.s2404_most_frequent_even_element.Solution

public class Solution extends Object
2404 - Most Frequent Even Element.<p>Easy</p> <p>Given an integer array <code>nums</code>, return <em>the most frequent even element</em>.</p> <p>If there is a tie, return the <strong>smallest</strong> one. If there is no such element, return <code>-1</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [0,1,2,2,4,4,1]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong></p> <p>The even elements are 0, 2, and 4. Of these, 2 and 4 appear the most.</p> <p>We return the smallest one, which is 2.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [4,4,4,9,2,4]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> 4 is the even element appears the most.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [29,47,21,41,13,37,25,7]</p> <p><strong>Output:</strong> -1</p> <p><strong>Explanation:</strong> There is no even element.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 2000</code></li> <li><code>0 <= nums[i] <= 10<sup>5</sup></code></li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • mostFrequentEven

      public int mostFrequentEven(int[] nums)