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.)
Runtime: 652 ms
Memory Usage: 49.7 MB
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。