Package g2801_2900.s2859_sum_of_values_at_indices_with_k_set_bits

Class Solution

java.lang.Object

g2801_2900.s2859_sum_of_values_at_indices_with_k_set_bits.Solution

public class Solution
extends java.lang.Object

2859 - Sum of Values at Indices With K Set Bits.

Easy

You are given a 0-indexed integer array nums and an integer k.

Return an integer that denotes the sum of elements in nums whose corresponding indices have exactly k set bits in their binary representation.

The set bits in an integer are the 1’s present when it is written in binary.

• For example, the binary representation of 21 is 10101, which has 3 set bits.

Example 1:

Input: nums = [5,10,1,5,2], k = 1

Output: 13

Explanation: The binary representation of the indices are:

0 = 000₂

1 = 001₂

2 = 010₂

3 = 011₂

4 = 100₂

Indices 1, 2, and 4 have k = 1 set bits in their binary representation. Hence, the answer is nums[1] + nums[2] + nums[4] = 13.

Example 2:

Input: nums = [4,3,2,1], k = 2

Output: 1

Explanation: The binary representation of the indices are:

0 = 00₂

1 = 01₂

2 = 10₂

3 = 11₂

Only index 3 has k = 2 set bits in its binary representation. Hence, the answer is nums[3] = 1.

Constraints:

• 1 <= nums.length <= 1000
• 1 <= nums[i] <= 105
• 0 <= k <= 10

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
static int	countSetBits(int num)
int	sumIndicesWithKSetBits(java.util.List<java.lang.Integer> nums, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

sumIndicesWithKSetBits

public int sumIndicesWithKSetBits(java.util.List<java.lang.Integer> nums,
 int k)

countSetBits

public static int countSetBits(int num)