1 Star 0 Fork 0

xiangxiang/LeetCode-NOTES

Create your Gitee Account
Explore and code with more than 13.5 million developers,Free private repositories !:)
Sign up
文件
Clone or Download
solution.cpp 961 Bytes
Copy Edit Raw Blame History
默然 authored 7 years ago . update all algorithms.
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution
{
public:
/** @param head The linked list's head.
Note that the head is guaranteed to be not null, so it contains at least one node. */
Solution(ListNode* head)
{
this->head = head;
this->len = 1;
ListNode* temp = head;
while(temp->next)
{
len++;
temp = temp->next;
}
}
/** Returns a random node's value. */
int getRandom()
{
int step = rand()%len;
ListNode* temp = this->head;;
for(int i=0;i<step;i++)
temp = temp->next;
return temp->val;
}
int len;
ListNode* head;
};
/**
* Your Solution object will be instantiated and called as such:
* Solution obj = new Solution(head);
* int param_1 = obj.getRandom();
*/
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/xiangxiang920/LeetCode-NOTES.git
git@gitee.com:xiangxiang920/LeetCode-NOTES.git
xiangxiang920
LeetCode-NOTES
LeetCode-NOTES
master

Search