原题
Design a data structure that supports all following operations in average O(1) time.
insert(val): Inserts an item val to the set if not already present.
remove(val): Removes an item val from the set if present.
getRandom: Returns a random element from current set of elements. Each element must have the same probability of being returned.
Example:
// Init an empty set.
RandomizedSet randomSet = new RandomizedSet();
// Inserts 1 to the set. Returns true as 1 was inserted successfully.
randomSet.insert(1);
// Returns false as 2 does not exist in the set.
randomSet.remove(2);
// Inserts 2 to the set, returns true. Set now contains [1,2].
randomSet.insert(2);
// getRandom should return either 1 or 2 randomly.
randomSet.getRandom();
// Removes 1 from the set, returns true. Set now contains [2].
randomSet.remove(1);
// 2 was already in the set, so return false.
randomSet.insert(2);
// Since 2 is the only number in the set, getRandom always return 2.
randomSet.getRandom();
代码实现
/// <summary>
/// IDG
/// </summary>
public class RandomizedSet
{
//insert remove getRandom
private Dictionary<int, int> _dict; //key: value, Value: index
private List<int> _valList; //element of value list, for it can get the O(1) visit
public RandomizedSet()
{
_dict = new Dictionary<int, int>();
_valList = new List<int>();
}
public bool Insert(int val)
{
if (!_dict.ContainsKey(val))
{
_dict.Add(val, _valList.Count);
_valList.Add(val);
return true;
}
return false;
}
public bool Remove(int val)
{
if (!_dict.ContainsKey(val)) return false;
int removeIndex = _dict[val]; //_dict.Values: element index collection
swapToLast(removeIndex);
_valList.Remove(val);
_dict.Remove(val);
return true;
}
//i-待移除元素的索引
//将待移除元素移到_valList的末尾,修改原来末尾元素在字典中的键值
private void swapToLast(int i)
{
int lastIndex = _valList.Count - 1;
if (i > lastIndex) return;
int lastVal = _valList[lastIndex];
int tmpVal = _valList[i];
_valList[i] = lastVal; // the key is to prove " i < lastIndex" !!!
_valList[lastIndex] = tmpVal;
//this is important, to update the last index value in dictionary
_dict[lastVal] = i;
}
public int GetRandom()
{
long tick = DateTime.Now.Ticks;
Random ran = new Random((int)(tick & 0xffffffffL) | (int)(tick >> 32));
int randnum = ran.Next(_valList.Count);
if (_valList.Count == 0) return -1;
//Thread.Sleep(20);
return _valList[randnum];
}
}
leetcode-solution库
leetcode算法题目解决方案每天更新在github库中,欢迎感兴趣的朋友加入进来,也欢迎star,或pull request。https://github.com/jackzhenguo/leetcode-csharp