【LeetCode】762. Prime Number of Set Bits in Binary Representation（C++）

最新推荐文章于 2025-06-17 07:15:00 发布

原创最新推荐文章于 2025-06-17 07:15:00 发布 · 227 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 专栏收录该内容

82 篇文章

订阅专栏

本文介绍了一个LeetCode上的编程挑战，目标是在指定范围内找出二进制表示中位数为质数的整数数量。通过分析问题，我们提供了一种解决方案，利用位操作技巧和预定义的质数集来高效地解决这个问题。

地址：https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/

题目：

Given two integers L and R, find the count of numbers in the range [L, R] (inclusive) having a prime number of set bits in their binary representation.

(Recall that the number of set bits an integer has is the number of 1s present when written in binary. For example, 21 written in binary is 10101 which has 3 set bits. Also, 1 is not a prime.)
Example 1:

Input: L = 6, R = 10
Output: 4
Explanation:
6 -> 110 (2 set bits, 2 is prime)
7 -> 111 (3 set bits, 3 is prime)
9 -> 1001 (2 set bits , 2 is prime)
10->1010 (2 set bits , 2 is prime)

Example 2:

Input: L = 10, R = 15
Output: 5
Explanation:
10 -> 1010 (2 set bits, 2 is prime)
11 -> 1011 (3 set bits, 3 is prime)
12 -> 1100 (2 set bits, 2 is prime)
13 -> 1101 (3 set bits, 3 is prime)
14 -> 1110 (3 set bits, 3 is prime)
15 -> 1111 (4 set bits, 4 is not prime)

Note:

L, R will be integers L <= R in the range [1, 10^6].
R - L will be at most 10000.

理解：

就是找到范围内的数中二进制表示中置位的个数为质数的数目。由于范围最大为10^6，最多需要20位数字表示，而20不是质数，因此最大为19即可。

实现：

class Solution {
public:
	int countPrimeSetBits(int l, int r) {
		set<int> primes = { 2, 3, 5, 7, 11, 13, 17, 19};
		int cnt = 0;
		for (int i = l; i <= r; i++) {
			int bits = 0;
			for (int n = i; n; n >>= 1)
				bits += n & 1;
			cnt += primes.count(bits);
		}
		return cnt;
	}
};

学到一个位操作n&(n-1)，可以每次把最末尾的1置为0，因此可以通过这个循环来判断被置位的比特数。

int cnt=0;
while(n){
    n&=(n-1);
    ++cnt;
}

更一般的方法就是直接判断了。

class Solution {
public:
	int countPrimeSetBits(int L, int R) {
		int count = 0;
		for (int i = L; i <= R; i++) {
			int cntbits = 0;
			int n = i;
			while (n) {
				n &= n - 1;
				++cntbits;
			}
			count += isPrime(cntbits);
		}
		return count;
	}

	bool isPrime(int num)
	{
		if (num <= 1)
			return false;
		int sqrt_num = sqrt(num);
		int i = 2;
		while (i <= sqrt_num)
		{
			if (!(num%i))
				return false;
			i++;
		}
		return true;
	}
};