rename

fishercoder1534 · fishercoder1534 · commit ddd63f529a26 · 2017-07-28T19:09:05.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_163.java b/src/main/java/com/fishercoder/solutions/_163.java
@@ -8,7 +8,7 @@
 
  For example, given [0, 1, 3, 50, 75], lower = 0 and upper = 99, return ["2", "4->49", "51->74", "76->99"].
  */
-public class MissingRanges {
+public class _163 {
 
     public List<String> findMissingRanges(int[] nums, int lower, int upper) {
         List<String> res = new ArrayList<String>();
diff --git a/src/main/java/com/fishercoder/solutions/_434.java b/src/main/java/com/fishercoder/solutions/_434.java
@@ -9,7 +9,7 @@
 
 Input: "Hello, my name is John"
 Output: 5*/
-public class NumberofSegmentsinaString {
+public class _434 {
 
     public int countSegments(String s) {
         if (s == null || s.isEmpty()) return 0;
diff --git a/src/main/java/com/fishercoder/solutions/_476.java b/src/main/java/com/fishercoder/solutions/_476.java
@@ -15,7 +15,7 @@
  Output: 0
  Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.
  */
-public class NumberComplement {
+public class _476 {
 
     public int findComplement_oneLiner(int num) {
         return ~num & ((Integer.highestOneBit(num) << 1) - 1);
diff --git a/src/main/java/com/fishercoder/solutions/_496.java b/src/main/java/com/fishercoder/solutions/_496.java
@@ -26,7 +26,7 @@
  All elements in nums1 and nums2 are unique.
  The length of both nums1 and nums2 would not exceed 1000.
  */
-public class NextGreaterElementI {
+public class _496 {
 
     public int[] nextGreaterElement_clever_way(int[] findNums, int[] nums) {
         Stack<Integer> stack = new Stack();
diff --git a/src/main/java/com/fishercoder/solutions/_503.java b/src/main/java/com/fishercoder/solutions/_503.java
@@ -16,7 +16,7 @@
  The second 1's next greater number needs to search circularly, which is also 2.
  Note: The length of given array won't exceed 10000.
  */
-public class NextGreaterElementII {
+public class _503 {
 
     //Credit: https://discuss.leetcode.com/topic/77881/typical-ways-to-solve-circular-array-problems-java-solution
     //Note: we store INDEX into the stack, reversely, the larger index put at the bottom of the stack, the smaller index at the top
diff --git a/src/main/java/com/fishercoder/solutions/_539.java b/src/main/java/com/fishercoder/solutions/_539.java
@@ -13,7 +13,7 @@
  The number of time points in the given list is at least 2 and won't exceed 20000.
  The input time is legal and ranges from 00:00 to 23:59.
  */
-public class MinimumTimeDifference {
+public class _539 {
 
     public int findMinDifference(List<String> timePoints) {
 //        there are in total 24*60 = 1440 possible time points
diff --git a/src/main/java/com/fishercoder/solutions/_556.java b/src/main/java/com/fishercoder/solutions/_556.java
@@ -12,7 +12,7 @@
  * Input: 21
  * Output: -1
  */
-public class NextGreaterElementIII {
+public class _556 {
     //credit: https://discuss.leetcode.com/topic/85759/this-problem-is-the-same-to-next-permutation-algorithm-only and https://discuss.leetcode.com/topic/85755/java-solution-like-next-permutation-problem-o-n
 
     public int nextGreaterElement(int n) {
diff --git a/src/test/java/com/fishercoder/MaxConsecutiveOnesIITest.java b/src/test/java/com/fishercoder/MaxConsecutiveOnesIITest.java
diff --git a/src/test/java/com/fishercoder/TheMazeIIITest.java b/src/test/java/com/fishercoder/TheMazeIIITest.java
diff --git a/src/test/java/com/fishercoder/_163Test.java b/src/test/java/com/fishercoder/_163Test.java
@@ -1,6 +1,6 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.MissingRanges;
+import com.fishercoder.solutions._163;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
@@ -13,9 +13,9 @@
 /**
  * Created by fishercoder on 12/31/16.
  */
-public class MissingRangesTest {
+public class _163Test {
 
-    private static MissingRanges test;
+    private static _163 test;
     private static List<String> expected;
     private static List<String> actual;
     private static int lower;
@@ -24,7 +24,7 @@ public class MissingRangesTest {
 
     @BeforeClass
     public static void setup(){
-        test = new MissingRanges();
+        test = new _163();
         expected = new ArrayList();
         actual = new ArrayList();
     }
diff --git a/src/test/java/com/fishercoder/_434Test.java b/src/test/java/com/fishercoder/_434Test.java
@@ -1,21 +1,21 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.NumberofSegmentsinaString;
+import com.fishercoder.solutions._434;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static junit.framework.Assert.assertEquals;
 
-public class NumberofSegmentsinaStringTest {
-    private static NumberofSegmentsinaString test;
+public class _434Test {
+    private static _434 test;
     private static int expected;
     private static int actual;
     private static String s;
 
     @BeforeClass
     public static void setup(){
-        test = new NumberofSegmentsinaString();
+        test = new _434();
     }
 
     @Before
diff --git a/src/test/java/com/fishercoder/_476Test.java b/src/test/java/com/fishercoder/_476Test.java
@@ -1,6 +1,6 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.NumberComplement;
+import com.fishercoder.solutions._476;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
@@ -10,15 +10,15 @@
 /**
  * Created by fishercoder on 1/14/17.
  */
-public class NumberComplementTest {
-    private static NumberComplement test;
+public class _476Test {
+    private static _476 test;
     private static int expected;
     private static int actual;
     private static int input;
 
     @BeforeClass
     public static void setup() {
-        test = new NumberComplement();
+        test = new _476();
     }
 
     @Before
diff --git a/src/test/java/com/fishercoder/_496Test.java b/src/test/java/com/fishercoder/_496Test.java
@@ -1,22 +1,22 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.NextGreaterElementI;
+import com.fishercoder.solutions._496;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static org.junit.Assert.assertArrayEquals;
 
-public class NextGreaterElementITest {
-    private static NextGreaterElementI test;
+public class _496Test {
+    private static _496 test;
     private static int[] findNums;
     private static int[] nums;
     private static int[] expected;
     private static int[] actual;
 
     @BeforeClass
     public static void setup(){
-        test = new NextGreaterElementI();
+        test = new _496();
     }
 
     @Before
diff --git a/src/test/java/com/fishercoder/_503Test.java b/src/test/java/com/fishercoder/_503Test.java
@@ -1,21 +1,21 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.NextGreaterElementII;
+import com.fishercoder.solutions._503;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static org.junit.Assert.assertArrayEquals;
 
-public class NextGreaterElementIITest {
-    private static NextGreaterElementII test;
+public class _503Test {
+    private static _503 test;
     private static int[] nums;
     private static int[] expected;
     private static int[] actual;
 
     @BeforeClass
     public static void setup(){
-        test = new NextGreaterElementII();
+        test = new _503();
     }
 
     @Before
diff --git a/src/test/java/com/fishercoder/_522Test.java b/src/test/java/com/fishercoder/_522Test.java
@@ -9,7 +9,7 @@
 /**
  * Created by fishercoder on 12/31/16.
  */
-public class LongestUncommonSubsequenceIITest {
+public class _522Test {
 
     private static _522 test;
     private static int expected;
diff --git a/src/test/java/com/fishercoder/_539Test.java b/src/test/java/com/fishercoder/_539Test.java
@@ -1,6 +1,6 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.MinimumTimeDifference;
+import com.fishercoder.solutions._539;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
@@ -11,15 +11,15 @@
 
 import static junit.framework.Assert.assertEquals;
 
-public class MinimumTimeDifferenceTest {
-    private static MinimumTimeDifference test;
+public class _539Test {
+    private static _539 test;
     private static int expected;
     private static int actual;
     private static List<String> timePoints;
 
     @BeforeClass
     public static void setup(){
-        test = new MinimumTimeDifference();
+        test = new _539();
     }
 
     @Before
diff --git a/src/test/java/com/fishercoder/_548Test.java b/src/test/java/com/fishercoder/_548Test.java
@@ -7,7 +7,7 @@
 
 import static junit.framework.Assert.assertEquals;
 
-public class SplitArraywithEqualSumTest {
+public class _548Test {
     private static _548 test;
     private static boolean expected;
     private static boolean actual;
diff --git a/src/test/java/com/fishercoder/_556Test.java b/src/test/java/com/fishercoder/_556Test.java
@@ -1,22 +1,22 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.NextGreaterElementIII;
+import com.fishercoder.solutions._556;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static org.junit.Assert.assertEquals;
 import static org.junit.Assert.assertTrue;
 
-public class NextGreaterElementIIITest {
-    private static NextGreaterElementIII test;
+public class _556Test {
+    private static _556 test;
     private static int n;
     private static int expected;
     private static int actual;
 
     @BeforeClass
     public static void setup(){
-        test = new NextGreaterElementIII();
+        test = new _556();
     }
 
     @Before
diff --git a/src/test/java/com/fishercoder/_69Test.java b/src/test/java/com/fishercoder/_69Test.java
@@ -10,7 +10,7 @@
 /**
  * Created by fishercoder on 1/25/17.
  */
-public class SqrtxTest {
+public class _69Test {
     private static _69 test;
     private static int expected;
     private static int actual;
