g0401_0500.s0458_poor_pigs.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0401_0500.s0458_poor_pigs;
// #Hard #Dynamic_Programming #Math #Combinatorics
// #2022_07_18_Time_0_ms_(100.00%)_Space_41_MB_(45.92%)
public class Solution {
public int poorPigs(int buckets, int minutesToDie, int minutesToTest) {
if (buckets-- == 1) {
return 0;
}
int base = minutesToTest / minutesToDie + 1;
int count = 0;
while (buckets > 0) {
buckets /= base;
count++;
}
return count;
}
}