fix problem number

Author: fishercoder1534

README.md

@@ -26,7 +26,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |763|[Partition Labels](https://leetcode.com/problems/partition-labels/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_763.java) | O(n) | O(1) | |Medium|
 |762|[Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_762.java) | O(n) | O(1) | |Easy|
 |760|[Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_760.java) | O(n^2) | O(1) | |Easy| 
-|755|[Reach a Number](https://leetcode.com/problems/reach-a-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_755.java) | O(n) | O(1) | |Medium| Math
+|754|[Reach a Number](https://leetcode.com/problems/reach-a-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_754.java) | O(n) | O(1) | |Medium| Math
 |750|[Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_750.java) | O((m*n)^2) | O(1) | |Medium|
 |748|[Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_748.java) | O(n) | O(1) | |Easy|
 |747|[Largest Number Greater Than Twice of Others](https://leetcode.com/problems/largest-number-greater-than-twice-of-others/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_747.java) | O(n) | O(1) | |Easy|

src/main/java/com/fishercoder/solutions/_755.java renamed to src/main/java/com/fishercoder/solutions/_754.java

@@ -1,7 +1,7 @@
 package com.fishercoder.solutions;
 
 /**
- * 755. Reach a Number
+ * 754. Reach a Number
  *
  * You are standing at position 0 on an infinite number line. There is a goal at position target.
  * On each move, you can either go left or right. During the n-th move (starting from 1), you take n steps.
@@ -26,7 +26,7 @@
  target will be a non-zero integer in the range [-10^9, 10^9].
  */
 
-public class _755 {
+public class _754 {
   public static class Solution1 {
     /**Two case:
      * 1. go to the right, and reach the goal exactly.

src/test/java/com/fishercoder/_755Test.java renamed to src/test/java/com/fishercoder/_754Test.java

@@ -1,17 +1,17 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions._755;
+import com.fishercoder.solutions._754;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static org.junit.Assert.assertEquals;
 
-public class _755Test {
-  private static _755.Solution1 solution1;
+public class _754Test {
+  private static _754.Solution1 solution1;
 
   @BeforeClass
   public static void setup() {
-    solution1 = new _755.Solution1();
+    solution1 = new _754.Solution1();
   }
 
   @Test