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-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g0401_0500.s0458_poor_pigs;
// #Hard #Dynamic_Programming #Math #Combinatorics
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;
}
}