refactor 458

fishercoder1534 · fishercoder1534 · commit 3d0282c6fbb3 · 2020-07-11T08:52:59.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_458.java b/src/main/java/com/fishercoder/solutions/_458.java
@@ -1,20 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 458. Poor Pigs
- *
- * There are 1000 buckets, one and only one of them contains poison,
- * the rest are filled with water.
- * They all look the same.
- * If a pig drinks that poison it will die within 15 minutes.
- * What is the minimum amount of pigs you need to figure out which bucket contains the poison within one hour.
- * Answer this question, and write an algorithm for the follow-up general case.
-
- Follow-up:
- If there are n buckets and a pig drinking poison will die within m minutes,
- how many pigs (x) you need to figure out the "poison" bucket within p minutes? There is exact one bucket with poison.
- 
- */
 public class _458 {
 
     public static class Solution1 {
