leetcodeSolution to some Leetcode problems written in C++ |
git clone git://git.dimitrijedobrota.com/leetcode.git |
Log | Files | Refs | README | LICENSE |
2657.cpp (705B)
0 // 2657. Find the Prefix Common Array of Two Arrays
1 class Solution {
2 public:
3 vector<int> findThePrefixCommonArray(const vector<int> &A, const vector<int> &B) {
4 vector<int> res(A.size());
5 unordered_set<int> setA, setB;
6 for (int i = 0, count = 0; i < A.size(); i++) {
7 if (A[i] == B[i])
8 count++;
9 else {
10 if (setB.count(A[i]))
11 count++;
12 else
13 setA.insert(A[i]);
14 if (setA.count(B[i]))
15 count++;
16 else
17 setB.insert(B[i]);
18 }
19 res[i] = count;
20 }
21 return res;
22 }
23 };