LeetCode 898. Bitwise ORs of Subarrays 子数组按位或操作

最新推荐文章于 2022-07-26 06:04:21 发布

原创最新推荐文章于 2022-07-26 06:04:21 发布 · 582 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode 898. #Bitwise ORs of Subarrays #子数组按位或操作

leetcode 同时被 2 个专栏收录

36 篇文章

订阅专栏

Set

1 篇文章

订阅专栏

该博客详细介绍了LeetCode 898题目的解题思路，通过从前向后扫描数组并进行按位或操作，计算所有可能的子数组按位或结果。文章提供了示例解析和代码实现，探讨了如何有效地求解这类问题。

LeetCode 898. Bitwise ORs of Subarrays 子数组按位或操作

- 898. Bitwise ORs of Subarrays

898. Bitwise ORs of Subarrays

题目描述

We have an array A of non-negative integers.

For every (contiguous) subarray B = [A[i], A[i+1], …, A[j]] (with i <= j), we take the bitwise OR of all the elements in B, obtaining a result A[i] | A[i+1] | … | A[j].

Return the number of possible results. (Results that occur more than once are only counted once in the final answer.)

Note:

1 <= A.length <= 50000
0 <= A[i] <= 10^9

示例:

Example 1:

Input: [0]
Output: 1
Explanation: 
There is only one possible result: 0.

Example 2:

Input: [1,1,2]
Output: 3
Explanation: 
The possible subarrays are [1], [1], [2], [1, 1], [1, 2], [1, 1, 2].
These yield the results 1, 1, 2, 1, 3, 3.
There are 3 unique values, so the answer is 3.

Example 3:

Input: [1,2,4]
Output: 6
Explanation: 
The possible results are 1, 2, 3, 4, 6, and 7.

解答

从前向后扫描一边数组，每遇到一个新的值，把这个值和之前所有可能的结果bitwise or一遍。

然后bitwise or的结果插入到res数组中。

最后返回res数组的长度。

代码


class Solution {
public:
    int subarrayBitwiseORs(vector<int>& A) {
        unordered_set<int> res;
        unordered_set<int> prev;
        for (auto &a : A) {
            unordered_set<int> curr;
            curr =  {a};
            for (auto &p : prev) {
                curr.insert(p | a);
            }
            prev = curr;
            res.insert(prev.begin(), prev.end());
        }
        return res.size();
    }
};