rename

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/MissingRanges.java renamed to 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>();

src/main/java/com/fishercoder/solutions/NumberofSegmentsinaString.java renamed to 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;

src/main/java/com/fishercoder/solutions/NumberComplement.java renamed to 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);

src/main/java/com/fishercoder/solutions/NextGreaterElementI.java renamed to 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();

src/main/java/com/fishercoder/solutions/NextGreaterElementII.java renamed to 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

src/main/java/com/fishercoder/solutions/MinimumTimeDifference.java renamed to 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

src/main/java/com/fishercoder/solutions/NextGreaterElementIII.java renamed to 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) {

src/test/java/com/fishercoder/MaxConsecutiveOnesIITest.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();
     }