762. Prime Number of Set Bits in Binary Representation 二进制表示形式中的素数位数

Posted Long Long Journey

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了762. 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:

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

给定两个整数L和R,找到在其二进制表示中具有设置位素数的范围[L,R](包含)范围内的数字的计数。 (回想一下,一个整数所设置的位数是用二进制写的时候存在的1的个数,例如,用二进制写的21是10101,它有3个设置位,而且1不是素数。
  1. /**
  2. * @param {number} L
  3. * @param {number} R
  4. * @return {number}
  5. */
  6. var countPrimeSetBits = function (L, R) {
  7. let primes = new Set([2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]);
  8. let res = 0;
  9. while (L <= R) {
  10. let str = L.toString(2);
  11. let match = str.match(/1/g);
  12. if (match && primes.has(match.length)) {
  13. res++;
  14. }
  15. L++;
  16. }
  17. return res;
  18. };
  19. let res = countPrimeSetBits(10, 15);
  20. console.log(res);






以上是关于762. Prime Number of Set Bits in Binary Representation 二进制表示形式中的素数位数的主要内容,如果未能解决你的问题,请参考以下文章

leetcode-762-Prime Number of Set Bits in Binary Representation

762. Prime Number of Set Bits in Binary Representation 二进制表示形式中的素数位数

762. Prime Number of Set Bits in Binary Representation二进制中有质数个1的数量

[LeetCode] Prime Number of Set Bits in Binary Representation

Sum of Consecutive Prime Numbers(poj2739)

Greedy:Sum of Consecutive Prime Numbers(POJ 2739)