solve problem Poor Pigs

Author: P-ppc

README.md

@@ -216,6 +216,7 @@ All solutions will be accepted!
 |706|[Design Hashmap](https://leetcode-cn.com/problems/design-hashmap/description/)|[java/py/js](./algorithms/DesignHashmap)|Easy|
 |872|[Leaf Similar Trees](https://leetcode-cn.com/problems/leaf-similar-trees/description/)|[java/py/js](./algorithms/LeafSimilarTrees)|Easy|
 |427|[Construct Quad Tree](https://leetcode-cn.com/problems/construct-quad-tree/description/)|[java/py](./algorithms/ConstructQuadTree)|Easy|
+|458|[Poor Pigs](https://leetcode-cn.com/problems/poor-pigs/description/)|[java/py/js](./algorithms/PoorPigs)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/PoorPigs/README.md

@@ -0,0 +1,2 @@
+# Poor Pigs
+We can solve this problem by bitwise or log function

algorithms/PoorPigs/Solution.java

@@ -0,0 +1,5 @@
+class Solution {
+    public int poorPigs(int buckets, int minutesToDie, int minutesToTest) {
+        return (int) Math.ceil(Math.log(buckets) / Math.log(minutesToTest / minutesToDie + 1));
+    }
+}

algorithms/PoorPigs/solution.js

@@ -0,0 +1,10 @@
+/**
+ * @param {number} buckets
+ * @param {number} minutesToDie
+ * @param {number} minutesToTest
+ * @return {number}
+ */
+var poorPigs = function(buckets, minutesToDie, minutesToTest) {
+    let base = parseInt(minutesToTest / minutesToDie) + 1
+    return Math.ceil(Math.log(buckets) / Math.log(base))
+};

algorithms/PoorPigs/solution.py

@@ -0,0 +1,15 @@
+class Solution(object):
+    def poorPigs(self, buckets, minutesToDie, minutesToTest):
+        """
+        :type buckets: int
+        :type minutesToDie: int
+        :type minutesToTest: int
+        :rtype: int
+        """
+        base = minutesToTest / minutesToDie + 1
+        buckets -= 1
+        count = 0
+        while buckets > 0:
+            buckets /= base
+            count += 1
+        return count