-
Notifications
You must be signed in to change notification settings - Fork 34
/
Solution.java
36 lines (34 loc) · 886 Bytes
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/**
* 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;
}
}
/**
* Your Solution object will be instantiated and called as such:
* Solution obj = new Solution(head);
* int param_1 = obj.getRandom();
*/