Skip to content

Commit b02b8eb

Browse files
edit 458
1 parent 89cc0a2 commit b02b8eb

File tree

3 files changed

+6
-6
lines changed

3 files changed

+6
-6
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -149,7 +149,7 @@ Your ideas/fixes/algorithms are more than welcome!
149149
|461|[Hamming Distance](https://leetcode.com/problems/hamming-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/HammingDistance.java) | O(n) |O(1) | Easy|
150150
|460|[LFU Cache](https://leetcode.com/problems/lfu-cache/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_460.java) | O(?) |O(?) | Hard| Design
151151
|459|[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_459.java)| O(n)|O(n) | Easy| KMP
152-
|458|[Poor Pigs](https://leetcode.com/problems/poor-pigs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/PoorPigs.java) | O(1) |O(1) | Easy| Math
152+
|458|[Poor Pigs](https://leetcode.com/problems/poor-pigs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_458.java) | O(1) |O(1) | Easy| Math
153153
|456|[132 Pattern](https://leetcode.com/problems/132-pattern/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_456.java) | O(n) |O(n) | Medium| Stack
154154
|455|[Assign Cookies](https://leetcode.com/problems/assign-cookies/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_455.java)| O(n)|O(1) | Easy|
155155
|454|[4Sum II](https://leetcode.com/problems/4sum-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_454.java) | O(n) |O(n) | Medium| HashMap

src/main/java/com/fishercoder/solutions/PoorPigs.java renamed to src/main/java/com/fishercoder/solutions/_458.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99
1010
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.
1111
*/
12-
public class PoorPigs {
12+
public class _458 {
1313

1414
public int poorPigs(int buckets, int minutesToDie, int minutesToTest) {
1515
if (buckets--==1){

src/test/java/com/fishercoder/PoorPigsTest.java renamed to src/test/java/com/fishercoder/_458Test.java

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,14 @@
11
package com.fishercoder;
22

3-
import com.fishercoder.solutions.PoorPigs;
3+
import com.fishercoder.solutions._458;
44
import org.junit.Before;
55
import org.junit.BeforeClass;
66
import org.junit.Test;
77

88
import static junit.framework.Assert.assertEquals;
99

10-
public class PoorPigsTest {
11-
private static PoorPigs test;
10+
public class _458Test {
11+
private static _458 test;
1212
private static int expected;
1313
private static int actual;
1414
private static int buckets;
@@ -17,7 +17,7 @@ public class PoorPigsTest {
1717

1818
@BeforeClass
1919
public static void setup(){
20-
test = new PoorPigs();
20+
test = new _458();
2121
}
2222

2323
@Before

0 commit comments

Comments
 (0)