refactor 382

fishercoder1534 · fishercoder1534 · commit 03bb323f8c3a · 2019-02-16T06:59:05.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_382.java b/src/main/java/com/fishercoder/solutions/_382.java
@@ -7,6 +7,7 @@
 import java.util.Random;
 
 /**382. Linked List Random Node
+ *
 Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen.
 
 Follow up:
@@ -25,14 +26,14 @@
 */
 public class _382 {
 
-    class Solution {
+    public static class Solution1 {
         private Map<Integer, ListNode> map;
         private Random rand;
 
         /**
          * @param head The linked list's head. Note that the head is guanranteed to be not null, so it contains at least one node.
          */
-        public Solution(ListNode head) {
+        public Solution1(ListNode head) {
             map = new HashMap();
             rand = new Random();
             int i = 0;
