rename

fishercoder1534 · fishercoder1534 · commit a4be1b4955aa · 2017-07-28T16:13:28.000-07:00
diff --git a/README.md b/README.md
@@ -90,7 +90,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |543|[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_543.java) | O(n) |O(h) | Easy | Tree/DFS/Recursion
 |542|[01 Matrix](https://leetcode.com/problems/01-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_542.java) | O(m*n) |O(n) | Medium | BFS
 |541|[Reverse String II](https://leetcode.com/problems/reverse-string-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_541.java) | O(n) |O(1) | Easy | String
-|540|[Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SingleElementinaSortedArray.java) | O(n) |O(1) | Medium | 
+|540|[Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_540.java) | O(n) |O(1) | Medium | 
 |539|[Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MinimumTimeDifference.java) | O(n) |O(1) | Medium | String
 |538|[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_538.java) | O(nlogn) |O(n) | Medium | Tree
 |537|[Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_537.java) | O(1) |O(1) | Medium | Math, String
diff --git a/src/main/java/com/fishercoder/solutions/_540.java b/src/main/java/com/fishercoder/solutions/_540.java
@@ -11,7 +11,7 @@
  Output: 10
  Note: Your solution should run in O(log n) time and O(1) space.
  */
-public class SingleElementinaSortedArray {
+public class _540 {
 //  TODO:  Could be optimized to O(logn) by using binary search
     public int singleNonDuplicate(int[] nums) {
         int result = 0;
diff --git a/src/test/java/com/fishercoder/_540Test.java b/src/test/java/com/fishercoder/_540Test.java
@@ -1,21 +1,21 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.SingleElementinaSortedArray;
+import com.fishercoder.solutions._540;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static junit.framework.Assert.assertEquals;
 
-public class SingleElementinaSortedArrayTest {
-    private static SingleElementinaSortedArray test;
+public class _540Test {
+    private static _540 test;
     private static int expected;
     private static int actual;
     private static int[] nums;
 
     @BeforeClass
     public static void setup(){
-        test = new SingleElementinaSortedArray();
+        test = new _540();
     }
 
     @Before
