2 points:
1.Same probability of returning
2.Solve it without relying on the size of the list
Lottery Game:
list: 1->2->3
index:0 1 2
variable:cur size,button,winner
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
private ListNode head;
/*@param head The Linked list's head.
Note that the head is guaranteed to be not null,so it contains at least 1 node. */
public Solution(ListNode head) {
this.head=head;
}
/*Returns a random node's value. */
public int getRandom() {
int winner=head.val;
ListNode cur=head;
for(int i=1;cur.next!=null;i++){
cur=cur.next;
if(getRandomNum(i+1)==i) winner=cur.val;
}
return winner;
}
public int getRandomNum(int n){
return (int)(Math.random()*n);
}
}
/**
* Your Solution object will be instantiated and called as such:
* Solution obj = new Solution(head);
* int param_1 = obj.getRandom();
*/