refactor 204

fishercoder1534 · fishercoder1534 · commit 275f12c4322d · 2017-09-20T07:50:32.000-07:00
diff --git a/README.md b/README.md
@@ -436,7 +436,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |208|[Implement Trie](https://leetcode.com/problems/implement-trie-prefix-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_208.java)| O(n)|O(1) | Medium| Trie
 |207|[Course Schedule](https://leetcode.com/problems/course-schedule/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_207.java)| O(?)|O(?) | Medium|
 |206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_206.java)| O(n)|O(1) | Easy | Linked List
-|205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)|[Solution](../../blmaster/src/94fishercoder/algorithms/_205.java)| O(n)|O(1) | Easy
+|205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_205.java)| O(n)|O(1) | Easy
 |204|[Count Primes](https://leetcode.com/problems/count-primes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_204.java)| O(nloglogn)|O(n) | Easy | The Sieve of Eratosthenes
 |203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_203.java)| O(n)|O(1) | Easy
 |202|[Happy Number](https://leetcode.com/problems/happy-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_202.java)| O(k)|O(k) | Easy
diff --git a/src/test/java/com/fishercoder/_204Test.java b/src/test/java/com/fishercoder/_204Test.java
@@ -40,4 +40,34 @@ public void test4() {
         assertEquals(114155, solution2.countPrimes(1500000));
     }
 
+    @Test
+    public void test5() {
+        assertEquals(10, solution1.countPrimes(30));
+        assertEquals(10, solution2.countPrimes(30));
+    }
+
+    @Test
+    public void test6() {
+        assertEquals(4, solution1.countPrimes(10));
+        assertEquals(4, solution2.countPrimes(10));
+    }
+
+    @Test
+    public void test7() {
+        assertEquals(8, solution1.countPrimes(20));
+        assertEquals(8, solution2.countPrimes(20));
+    }
+
+    @Test
+    public void test8() {
+        assertEquals(12, solution1.countPrimes(40));
+        assertEquals(12, solution2.countPrimes(40));
+    }
+
+    @Test
+    public void test9() {
+        assertEquals(15, solution1.countPrimes(50));
+        assertEquals(15, solution2.countPrimes(50));
+    }
+
 }
