number-of-subarrays-with-and-value-of-k

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an array of integers <code>nums</code> and an integer <code>k</code>, return the number of subarrays of <code>nums</code> where the bitwise <code>AND</code> of the elements of the subarray equals <code>k</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [1,1,1], k = 1

Output: 6

Explanation:

All subarrays contain only 1&#39;s.
</div>

Example 2:

<div class="example-block">
Input: nums = [1,1,2], k = 1

Output: 3

Explanation:

Subarrays having an <code>AND</code> value of 1 are: <code>[1,1,2]</code>, <code>[1,1,2]</code>, <code>[1,1,2]</code>.
</div>

Example 3:

<div class="example-block">
Input: nums = [1,2,3], k = 2

Output: 2

Explanation:

Subarrays having an <code>AND</code> value of 2 are: <code>[1,2,3]</code>, <code>[1,2,3]</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>0 &lt;= nums[i], k &lt;= 109</code></li>
</ul>

第 134 场双周赛

biweekly-contest-134

countSubarrays

首席工程师

Number of Subarrays With AND Value of K

Bit Manipulation

Segment Tree

Array

Binary Search

给你一个整数数组&nbsp;<code>nums</code>&nbsp;和一个整数&nbsp;<code>k</code>&nbsp;，请你返回&nbsp;<code>nums</code>&nbsp;中有多少个子数组满足：子数组中所有元素按位&nbsp;<code>AND</code>&nbsp;的结果为 <code>k</code>&nbsp;。

&nbsp;

示例 1：

<div class="example-block">
输入：nums = [1,1,1], k = 1

输出：6

解释：

所有子数组都只含有元素 1 。
</div>

示例 2：

<div class="example-block">
输入：nums = [1,1,2], k = 1

输出：3

解释：

按位&nbsp;<code>AND</code>&nbsp;值为 1 的子数组包括：<code>[1,1,2]</code>, <code>[1,1,2]</code>, <code>[1,1,2]</code>&nbsp;。
</div>

示例 3：

<div class="example-block">
输入：nums = [1,2,3], k = 2

输出：2

解释：

按位&nbsp;<code>AND</code>&nbsp;值为 2 的子数组包括：<code>[1,2,3]</code>, <code>[1,2,3]</code>&nbsp;。
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>0 &lt;= nums[i], k &lt;= 109</code></li>
</ul>