Number of Integers With Popcount-Depth Equal to K II
You are given an integer array nums.
You are given an integer array nums.
For any positive integer x, define the following sequence:
This sequence will eventually reach the value 1.
The popcount-depth of x is defined as the smallest integer d >= 0 such that pd = 1.
For example, if x = 7 (binary representation "111"). Then, the sequence is: 7 → 3 → 2 → 1, so the popcount-depth of 7 is 3.
You are also given a 2D integer array queries, where each queries[i] is either:
Return an integer array answer, where answer[i] is the number of indices for the ith query of type [1, l, r, k].
Example 1
Input: nums = [2,4], queries = [[1,0,1,1],[2,1,1],[1,0,1,0]]
Output: [2,1]
Explanation: Thus, the final answer is [2, 1] .
Example 2
Input: nums = [3,5,6], queries = [[1,0,2,2],[2,1,4],[1,1,2,1],[1,0,1,0]]
Output: [3,1,0]
Explanation: Thus, the final answer is [3, 1, 0] .
Example 3
Input: nums = [1,2], queries = [[1,0,1,1],[2,0,3],[1,0,0,1],[1,0,0,2]]
Output: [1,0,1]
Explanation: Thus, the final answer is [1, 0, 1] .
Constraints
- 1 <= n == nums.length <= 10^5
- 1 <= nums[i] <= 1015
- 1 <= queries.length <= 10^5
- queries[i].length == 3 or 4 queries[i] == [1, l, r, k] or, queries[i] == [2, idx, val] 0 <= l <= r <= n - 1 0 <= k <= 5 0 <= idx <= n - 1 1 <= val <= 1015
- queries[i] == [1, l, r, k] or,
- queries[i] == [2, idx, val]
- 0 <= l <= r <= n - 1
- 0 <= k <= 5
- 0 <= idx <= n - 1
- 1 <= val <= 1015
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.