refactor 382

fishercoder1534 · fishercoder1534 · commit c506fd9c6d26 · 2020-06-26T07:42:33.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_382.java b/src/main/java/com/fishercoder/solutions/_382.java
@@ -6,24 +6,6 @@
 import java.util.Map;
 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:
-What if the linked list is extremely large and its length is unknown to you? Could you solve this efficiently without using extra space?
-
-Example:
-
-// Init a singly linked list [1,2,3].
-ListNode head = new ListNode(1);
-head.next = new ListNode(2);
-head.next.next = new ListNode(3);
-Solution solution = new Solution(head);
-
-// getRandom() should return either 1, 2, or 3 randomly. Each element should have equal probability of returning.
-solution.getRandom();
-*/
 public class _382 {
 
     public static class Solution1 {
