Class Solution
java.lang.Object
g2601_2700.s2657_find_the_prefix_common_array_of_two_arrays.Solution
2657 - Find the Prefix Common Array of Two Arrays.<p>Medium</p>
<p>You are given two <strong>0-indexed</strong> integer permutations <code>A</code> and <code>B</code> of length <code>n</code>.</p>
<p>A <strong>prefix common array</strong> of <code>A</code> and <code>B</code> is an array <code>C</code> such that <code>C[i]</code> is equal to the count of numbers that are present at or before the index <code>i</code> in both <code>A</code> and <code>B</code>.</p>
<p>Return <em>the <strong>prefix common array</strong> of</em> <code>A</code> <em>and</em> <code>B</code>.</p>
<p>A sequence of <code>n</code> integers is called a <strong>permutation</strong> if it contains all integers from <code>1</code> to <code>n</code> exactly once.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> A = [1,3,2,4], B = [3,1,2,4]</p>
<p><strong>Output:</strong> [0,2,3,4]</p>
<p><strong>Explanation:</strong> At i = 0: no number is common, so C[0] = 0.</p>
<p>At i = 1: 1 and 3 are common in A and B, so C[1] = 2.</p>
<p>At i = 2: 1, 2, and 3 are common in A and B, so C[2] = 3.</p>
<p>At i = 3: 1, 2, 3, and 4 are common in A and B, so C[3] = 4.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> A = [2,3,1], B = [3,1,2]</p>
<p><strong>Output:</strong> [0,1,3]</p>
<p><strong>Explanation:</strong> At i = 0: no number is common, so C[0] = 0.</p>
<p>At i = 1: only 3 is common in A and B, so C[1] = 1.</p>
<p>At i = 2: 1, 2, and 3 are common in A and B, so C[2] = 3.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= A.length == B.length == n <= 50</code></li>
<li><code>1 <= A[i], B[i] <= n</code></li>
<li><code>It is guaranteed that A and B are both a permutation of n integers.</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
findThePrefixCommonArray
public int[] findThePrefixCommonArray(int[] a, int[] b)
-