-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram27.java
More file actions
82 lines (53 loc) · 2.03 KB
/
program27.java
File metadata and controls
82 lines (53 loc) · 2.03 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/*
2657. Find the Prefix Common Array of Two Arrays
Medium
131
5
Companies
You are given two 0-indexed integer permutations A and B of length n.
A prefix common array of A and B is an array C such that C[i] is equal to the count of numbers that are present at or before the index i in both A and B.
Return the prefix common array of A and B.
A sequence of n integers is called a permutation if it contains all integers from 1 to n exactly once.
Example 1:
Input: A = [1,3,2,4], B = [3,1,2,4]
Output: [0,2,3,4]
Explanation: At i = 0: no number is common, so C[0] = 0.
At i = 1: 1 and 3 are common in A and B, so C[1] = 2.
At i = 2: 1, 2, and 3 are common in A and B, so C[2] = 3.
At i = 3: 1, 2, 3, and 4 are common in A and B, so C[3] = 4.
Example 2:
Input: A = [2,3,1], B = [3,1,2]
Output: [0,1,3]
Explanation: At i = 0: no number is common, so C[0] = 0.
At i = 1: only 3 is common in A and B, so C[1] = 1.
At i = 2: 1, 2, and 3 are common in A and B, so C[2] = 3.
*/
package LeetCode;
public class program27 {
static int[] findThePrefixCommonArray(int[] A, int[] B) {
int res[] = new int[A.length];
for(int i=0;i<A.length;i++){
int cnt=0;
for(int k=0;k<=i;k++){
for(int j=0;j<=i;j++){
if(A[k]==B[j]){
cnt++;
}
else{
continue;
}
}
}
res[i] = cnt;
}
return res;
}
public static void main(String[] args) {
int A[] = {1,3,2,4};
int B[] = {3,1,2,4};
int a[] = findThePrefixCommonArray(A, B);
for(int i=0;i<a.length;i++){
System.out.print(a[i]+" ");
}
}
}