zoukankan      html  css  js  c++  java
  • #Leetcode# 762. Prime Number of Set Bits in Binary Representation

    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:

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

    代码:

    class Solution {
    public:
        int countPrimeSetBits(int L, int R) {
            vector<int> ans = countBits(R);
            int n = ans.size();
            int cnt = 0;
            for(int i = L; i < n; i ++) {
                if(isPrime(ans[i])) cnt ++;
            }
            return cnt;
        }
        vector<int> countBits(int num) {
            vector<int> dp(num + 1, 0);
            dp[0] = 0;
            for(int i = 1; i <= num; i ++) {
                if(isPowerOfTwo(i)) dp[i] = 1;
                else if(i % 2) dp[i] = dp[i - 1] + 1;
                else dp[i] = dp[i / 2];
            }
            return dp;
        }
        bool isPowerOfTwo(int n) {
            if(n <= 0) return false;
            if((n & (n - 1)) == 0) return true;
            return false;
        }
        bool isPrime(int x) {
            if(x == 2) return true;
            if(x == 1 || x == 0) return false;
            for(int i = 2; i * i <= x; i ++)
                if(x % i == 0) return false;
            return true;
        }
    };
    

      

  • 相关阅读:
    sql server 常用脚本之table操作
    sql server 常用脚本之数据库操作
    PHP 生成日历
    转 mysql 问题一则
    转 php 前端知识点
    转 nbu 知识点
    转 php python 知识点
    oralce 问题几则 ORA-19504 报错
    AWR 报告脚本实现
    转 php 框架 Php 依赖框架 后台 调用python 脚本
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/10848679.html
Copyright © 2011-2022 走看看