Re: [閒聊] 每日leetcode

[dont (dont)]

2657. Find the Prefix Common Array of Two Arrays

## 思路

掃Array, 把A[i], B[i]的bit設1
檢查兩個mask &之後的bits數

## Code

```cpp
class Solution {
public:
    vector<int> findThePrefixCommonArray(vector<int>& A, vector<int>& B) {
        int n = A.size();

        bitset<51> maskA=0, maskB=0;
        vector<int> res(n, 0);
        for (int i=0; i<n; ++i) {
            maskA[A[i]] = 1;
            maskB[B[i]] = 1;
            res[i] = (maskA & maskB).count();
        }
        return res;
    }
};
```

--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 89.187.161.77 (日本)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1736853371.A.FB1.html
→ sustainer123: 大師
推 sustainer123: 原來這題考位運算喔