edit 287

fishercoder1534 · fishercoder1534 · commit 656419e57b7d · 2017-07-25T13:00:02.000-07:00
diff --git a/README.md b/README.md
@@ -303,7 +303,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |290|[Word Pattern](https://leetcode.com/problems/word-pattern/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_290.java)| O(n)|O(n) | Easy| 
 |289|[Game of Life](https://leetcode.com/problems/game-of-life/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_289.java)| O(m*n)|O(m*n), could be optimized to O(1) | Medium|
 |288|[Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_288.java)| O(n)|O(1) | Easy| 
-|287|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/FindtheDuplicateNumber.java)| O(n)|O(1) | Medium| 
+|287|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_287.java)| O(n)|O(1) | Medium| 
 |286|[Walls and Gates](https://leetcode.com/problems/walls-and-gates/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_286.java)| O(m*n)|O(g) | Medium| BFS
 |285|[Inorder Successor In BST](https://leetcode.com/problems/inorder-successor-in-bst/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_285.java)| O(h)|O(1) | Medium| Tree
 |284|[Peeking Iterator](https://leetcode.com/problems/peeking-iterator/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_284.java)| O(n)|O(n) | Medium| Design
diff --git a/src/main/java/com/fishercoder/solutions/_287.java b/src/main/java/com/fishercoder/solutions/_287.java
@@ -14,7 +14,7 @@ Your runtime complexity should be less than O(n2).
  There is only one duplicate number in the array, but it could be repeated more than once.
 
  */
-public class FindtheDuplicateNumber {
+public class _287 {
 
     //no-brainer, used O(n) space
     public int findDuplicate(int[] nums) {
