aboutsummaryrefslogtreecommitdiff
path: root/linked_list_random.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'linked_list_random.cpp')
-rw-r--r--linked_list_random.cpp40
1 files changed, 0 insertions, 40 deletions
diff --git a/linked_list_random.cpp b/linked_list_random.cpp
deleted file mode 100644
index ae147c5..0000000
--- a/linked_list_random.cpp
+++ /dev/null
@@ -1,40 +0,0 @@
-// 382. Linked List Random Node
-#include "leetcode.h"
-
-/*
- * given singly linked list, return a random node's value from the linked list.
- * each node must have the same probability of being chosen. implement
- * 'Solution' class: f1: initialises object with head of signly linked list
- * 'head' f2: chooses node randomly from list and returns its value. all nodes
- * should be equally likely to be chosen
- */
-
-class Solution {
-public:
- Solution(ListNode *head) {
- this->head = head;
- while (head != NULL) {
- this->n++;
- head = head->next;
- }
- }
- int getRandom() {
- int i = rand() % this->n;
- ListNode *p = this->head;
- while (i) {
- p = p->next;
- i -= 1;
- }
- return p->val;
- }
-
-private:
- int n = 0;
- ListNode *head = NULL;
-};
-
-int main() {
- ListNode *head;
- Solution *obj = new Solution(head);
- int param_1 = obj->getRandom();
-}