Package g2601_2700.s2672_number_of_adjacent_elements_with_the_same_color

Class Solution

java.lang.Object

g2601_2700.s2672_number_of_adjacent_elements_with_the_same_color.Solution

public class Solution
extends Object

2672 - Number of Adjacent Elements With the Same Color.<p>Medium</p> <p>There is a <strong>0-indexed</strong> array <code>nums</code> of length <code>n</code>. Initially, all elements are <strong>uncolored</strong> (has a value of <code>0</code>).</p> <p>You are given a 2D integer array <code>queries</code> where <code>queries[i] = [index_i, color_i]</code>.</p> <p>For each query, you color the index <code>index_i</code> with the color <code>color_i</code> in the array <code>nums</code>.</p> <p>Return <em>an array</em> <code>answer</code> <em>of the same length as</em> <code>queries</code> <em>where</em> <code>answer[i]</code> <em>is the number of adjacent elements with the same color <strong>after</strong> the</em> <code>i^th</code> <em>query</em>.</p> <p>More formally, <code>answer[i]</code> is the number of indices <code>j</code>, such that <code>0 <= j < n - 1</code> and <code>nums[j] == nums[j + 1]</code> and <code>nums[j] != 0</code> after the <code>i^th</code> query.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> n = 4, queries = [[0,2],[1,2],[3,1],[1,1],[2,1]]</p> <p><strong>Output:</strong> [0,1,1,0,2]</p> <p><strong>Explanation:</strong> Initially array nums = [0,0,0,0], where 0 denotes uncolored elements of the array.</p> <ul> <li>After the 1^st query nums = [2,0,0,0]. The count of adjacent elements with the same color is 0.</li> <li>After the 2^nd query nums = [2,2,0,0]. The count of adjacent elements with the same color is 1.</li> <li>After the 3^rd query nums = [2,2,0,1]. The count of adjacent elements with the same color is 1.</li> <li>After the 4^th query nums = [2,1,0,1]. The count of adjacent elements with the same color is 0.</li> <li>After the 5^th query nums = [2,1,1,1]. The count of adjacent elements with the same color is 2.</li> </ul> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> n = 1, queries = [[0,100000]]</p> <p><strong>Output:</strong> [0]</p> <p><strong>Explanation:</strong> Initially array nums = [0], where 0 denotes uncolored elements of the array.</p> <ul> <li>After the 1^st query nums = [100000]. The count of adjacent elements with the same color is 0.</li> </ul> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= n <= 10⁵</code></li> <li><code>1 <= queries.length <= 10⁵</code></li> <li><code>queries[i].length == 2</code></li> <li><code>0 <= index_i <= n - 1</code></li> <li><code>1 <= color_i <= 10⁵</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	colorTheArray(int n, int[][] q)

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

colorTheArray

public int[] colorTheArray(int n,
 int[][] q)