-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path0380-InsertDeleteGetRandom.cs
56 lines (49 loc) · 1.75 KB
/
0380-InsertDeleteGetRandom.cs
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
//-----------------------------------------------------------------------------
// Runtime: 144ms
// Memory Usage: 40.5 MB
// Link: https://leetcode.com/submissions/detail/352711483/
//-----------------------------------------------------------------------------
using System;
using System.Collections.Generic;
namespace LeetCode
{
public class _0380_InsertDeleteGetRandom
{
private readonly Random random = new Random();
private readonly IDictionary<int, int> locations;
private readonly IList<int> nums;
/** Initialize your data structure here. */
public _0380_InsertDeleteGetRandom()
{
locations = new Dictionary<int, int>();
nums = new List<int>();
}
/** Inserts a value to the set. Returns true if the set did not already contain the specified element. */
public bool Insert(int val)
{
if (locations.ContainsKey(val)) return false;
locations.Add(val, nums.Count);
nums.Add(val);
return true;
}
/** Removes a value from the set. Returns true if the set contained the specified element. */
public bool Remove(int val)
{
if (!locations.ContainsKey(val)) return false;
if (locations[val] != nums.Count - 1)
{
nums[locations[val]] = nums[nums.Count - 1];
locations[nums[nums.Count - 1]] = locations[val];
}
locations.Remove(val);
nums.RemoveAt(nums.Count - 1);
return true;
}
/** Get a random element from the set. */
public int GetRandom()
{
var index = random.Next(nums.Count);
return nums[index];
}
}
}