reservoirsampling (1) 썸네일형 리스트형 Leetcode: Linked List Random Node (Reservoir Sampling: 저수지 샘플링) 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.. 이전 1 다음