Package g2101_2200.s2190_most_frequent_number_following_key_in_an_array

Class Solution

java.lang.Object

g2101_2200.s2190_most_frequent_number_following_key_in_an_array.Solution

public class Solution
extends Object

2190 - Most Frequent Number Following Key In an Array.<p>Easy</p> <p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>. You are also given an integer <code>key</code>, which is present in <code>nums</code>.</p> <p>For every unique integer <code>target</code> in <code>nums</code>, <strong>count</strong> the number of times <code>target</code> immediately follows an occurrence of <code>key</code> in <code>nums</code>. In other words, count the number of indices <code>i</code> such that:</p> <ul> <li><code>0 <= i <= nums.length - 2</code>,</li> <li><code>nums[i] == key</code> and,</li> <li><code>nums[i + 1] == target</code>.</li> </ul> <p>Return <em>the</em> <code>target</code> <em>with the <strong>maximum</strong> count</em>. The test cases will be generated such that the <code>target</code> with maximum count is unique.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,100,200,1,100], key = 1</p> <p><strong>Output:</strong> 100</p> <p><strong>Explanation:</strong> For target = 100, there are 2 occurrences at indices 1 and 4 which follow an occurrence of key.</p> <p>No other integers follow an occurrence of key, so we return 100.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [2,2,2,2,3], key = 2</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> For target = 2, there are 3 occurrences at indices 1, 2, and 3 which follow an occurrence of key.</p> <p>For target = 3, there is only one occurrence at index 4 which follows an occurrence of key.</p> <p>target = 2 has the maximum number of occurrences following an occurrence of key, so we return 2.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>2 <= nums.length <= 1000</code></li> <li><code>1 <= nums[i] <= 1000</code></li> <li>The test cases will be generated such that the answer is unique.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	mostFrequent(int[] nums, int key)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

mostFrequent

public int mostFrequent(int[] nums,
 int key)