refactor 506

fishercoder1534 · fishercoder1534 · commit ba4b6b1a825b · 2019-05-27T08:38:16.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_506.java b/src/main/java/com/fishercoder/solutions/_506.java
@@ -5,7 +5,10 @@
 import java.util.Map;
 
 /**
- * Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Medal" and "Bronze Medal".
+ * 506. Relative Ranks
+ *
+ * Given scores of N athletes, find their relative ranks and the people with the top three highest scores,
+ * who will be awarded medals: "Gold Medal", "Silver Medal" and "Bronze Medal".
 
  Example 1:
  Input: [5, 4, 3, 2, 1]
@@ -19,30 +22,32 @@
  */
 public class _506 {
 
-    public String[] findRelativeRanks(int[] nums) {
-        int[] tmp = new int[nums.length];
-        for (int i = 0; i < nums.length; i++) {
-            tmp[i] = nums[i];
-        }
-        Arrays.sort(tmp);
-        Map<Integer, String> rankMap = new HashMap();
-        int len = nums.length;
-        for (int i = len - 1; i >= 0; i--) {
-            if (i == len - 1) {
-                rankMap.put(tmp[i], "Gold Medal");
-            } else if (i == len - 2) {
-                rankMap.put(tmp[i], "Silver Medal");
-            } else if (i == len - 3) {
-                rankMap.put(tmp[i], "Bronze Medal");
-            } else {
-                rankMap.put(tmp[i], String.valueOf(len - i));
+    public static class Solution1 {
+        public String[] findRelativeRanks(int[] nums) {
+            int[] tmp = new int[nums.length];
+            for (int i = 0; i < nums.length; i++) {
+                tmp[i] = nums[i];
             }
+            Arrays.sort(tmp);
+            Map<Integer, String> rankMap = new HashMap();
+            int len = nums.length;
+            for (int i = len - 1; i >= 0; i--) {
+                if (i == len - 1) {
+                    rankMap.put(tmp[i], "Gold Medal");
+                } else if (i == len - 2) {
+                    rankMap.put(tmp[i], "Silver Medal");
+                } else if (i == len - 3) {
+                    rankMap.put(tmp[i], "Bronze Medal");
+                } else {
+                    rankMap.put(tmp[i], String.valueOf(len - i));
+                }
+            }
+            String[] result = new String[len];
+            for (int i = 0; i < len; i++) {
+                result[i] = rankMap.get(nums[i]);
+            }
+            return result;
         }
-        String[] result = new String[len];
-        for (int i = 0; i < len; i++) {
-            result[i] = rankMap.get(nums[i]);
-        }
-        return result;
     }
 
 }
diff --git a/src/test/java/com/fishercoder/_506Test.java b/src/test/java/com/fishercoder/_506Test.java
@@ -11,14 +11,14 @@
  * Created by fishercoder on 1/15/17.
  */
 public class _506Test {
-    private static _506 test;
+    private static _506.Solution1 solution1;
     private static String[] expected;
     private static String[] actual;
     private static int[] nums;
 
     @BeforeClass
     public static void setup() {
-        test = new _506();
+        solution1 = new _506.Solution1();
     }
 
     @Before
@@ -31,7 +31,7 @@ public void setupForEachTest() {
     public void test1() {
         nums = new int[]{2, 4, 1};
         expected = new String[]{"Silver Medal", "Gold Medal", "Bronze Medal"};
-        actual = test.findRelativeRanks(nums);
+        actual = solution1.findRelativeRanks(nums);
         assertArrayEquals(expected, actual);
 
     }
@@ -40,7 +40,7 @@ public void test1() {
     public void test2() {
         nums = new int[]{5, 4, 3, 2, 1};
         expected = new String[]{"Gold Medal", "Silver Medal", "Bronze Medal", "4", "5"};
-        actual = test.findRelativeRanks(nums);
+        actual = solution1.findRelativeRanks(nums);
         assertArrayEquals(expected, actual);
 
     }
