solve problem Prime Number Of Set Bits In Binary Representation

Author: P-ppc

README.md

@@ -80,6 +80,7 @@ All solutions will be accepted!
 |268|[Missing Number](https://leetcode-cn.com/problems/missing-number/description/)|[java/py/js](./algorithms/MissingNumber)|Easy|
 |788|[Rotated Digits](https://leetcode-cn.com/problems/rotated-digits/description/)|[java/py/js](./algorithms/RotatedDigits)|Easy|
 |695|[Max Area Of Island](https://leetcode-cn.com/problems/max-area-of-island/description/)|[java/py/js](./algorithms/MaxAreaOfIsland)|Easy|
+|762|[Prime Number Of Set Bits In Binary Representation](https://leetcode-cn.com/problems/prime-number-of-set-bits-in-binary-representation/description/)|[java/py/js](./algorithms/PrimeNumberOfSetBitsInBinaryRepresentation)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/PrimeNumberOfSetBitsInBinaryRepresentation/README.md

@@ -0,0 +1,2 @@
+# Prime Number Of Set Bits In Binary Representation
+This problem is easy to solve

algorithms/PrimeNumberOfSetBitsInBinaryRepresentation/Solution.java

@@ -0,0 +1,30 @@
+class Solution {
+    public int countPrimeSetBits(int L, int R) {
+        int count = 0;
+        
+        for (int i = L; i <= R; i++) {
+            int oneCount = 0, x = i;
+            
+            while (x > 1) {
+                x &= x - 1;
+                oneCount++;
+            }
+            
+            if (oneCount > 1) {
+                x = oneCount / 2;
+                boolean isPrime = true;
+                while (x > 1) {
+                    if (oneCount % x == 0) {
+                        isPrime = false;
+                        break;
+                    } else {
+                        x--;
+                    }
+                }
+                if (isPrime) count++;
+            }
+        }
+        
+        return count;
+    }
+}

algorithms/PrimeNumberOfSetBitsInBinaryRepresentation/solution.js

@@ -0,0 +1,32 @@
+/**
+ * @param {number} L
+ * @param {number} R
+ * @return {number}
+ */
+var countPrimeSetBits = function(L, R) {
+    let count = 0
+    
+    for (let i = L; i <= R; i++) {
+        let oneCount = 0, x = i
+        while (x !== 0) {
+            x &= x - 1
+            oneCount++
+        }
+        
+        if (oneCount !== 1) {
+            let x = parseInt(oneCount / 2),
+                isPrime = true
+            while (x > 1) {
+                if (oneCount % x === 0) {
+                    isPrime = false
+                    break
+                } else {
+                    x--
+                }
+            }
+            if (isPrime) count++
+        }
+    }
+    
+    return count
+};

algorithms/PrimeNumberOfSetBitsInBinaryRepresentation/solution.py

@@ -0,0 +1,29 @@
+class Solution(object):
+    def countPrimeSetBits(self, L, R):
+        """
+        :type L: int
+        :type R: int
+        :rtype: int
+        """
+        count = 0
+        for i in range(L, R + 1):
+            one_count = 0
+            while i != 0:
+                i &= i - 1
+                one_count += 1
+            
+            # 1 is not a prime
+            if one_count == 1:
+                continue
+            
+            # judge is prime
+            x = one_count / 2
+            while x > 1:
+                if one_count % x == 0:
+                    break
+                else:
+                    x -= 1
+            else:
+                count += 1
+        
+        return count