Linked List Random Node思路:常数空间求随机元素,显然不能用队列存储,那么利用公式
第i个元素取到的概率等于 1/i,他被保留的概率等于 1/i*(i/(1+i))*.......*(n-1/n)=1/n
GitHub地址:https://github.com/corpsepiges/leetcode
目前java版本的答案大约进度是免费的差40题,python大约是一半,其他的等以后再补充。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
ListNode node;
/** @param head The linked list's head.
Note that the head is guaranteed to be not null, so it contains at least one node. */
public Solution(ListNode head) {
node=head;
}
/** Returns a random node's value. */
public int getRandom() {
ListNode ans=node;
int val=ans.val;
Random r=new Random();
for (int i = 1; ans!=null; i++) {
if (r.nextInt(i)==0) {
val=ans.val;
}
ans=ans.next;
}
return val;
}
}