.Zzumbong

[leetCode/JS] 380. Insert Delete GetRandom O(1) ๋ณธ๋ฌธ

coding test/leetCode

[leetCode/JS] 380. Insert Delete GetRandom O(1)

์ญ˜๋ด‰ 2022. 11. 29. 14:43

๋‚œ์ด๋„ [ ๐Ÿค” ] Medium

๋ฌธ์ œ ์„ค๋ช…

Implement the RandomizedSet class:

  • RandomizedSet() Initializes the RandomizedSet object.
  • bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwise.
  • bool remove(int val) Removes an item val from the set if present. Returns true if the item was present, false otherwise.
  • int getRandom() Returns a random element from the current set of elements (it's guaranteed that at least one element exists when this method is called). Each element must have the same probability of being returned.

You must implement the functions of the class such that each function works in average O(1) time complexity.

 

RandomizedSet ํด๋ž˜์Šค๋ฅผ ๋งŒ๋“ค์–ด์„œ 
insert(val) ๋กœ value๋ฅผ ๋„ฃ๊ณ , remove()๋กœ ์ง€์šฐ๊ณ , getRandom() ๋žœ๋ค 1๊ฐœ ๋ฝ‘์•„์˜จ๋‹ค.

 

 

์ž…์ถœ๋ ฅ ์˜ˆ

Example 1:

Input
["RandomizedSet", "insert", "remove", "insert", "getRandom", "remove", "insert", "getRandom"]
[[], [1], [2], [2], [], [1], [2], []]
Output
[null, true, false, true, 2, true, false, 2]

Explanation
RandomizedSet randomizedSet = new RandomizedSet();
randomizedSet.insert(1); // Inserts 1 to the set. Returns true as 1 was inserted successfully.
randomizedSet.remove(2); // Returns false as 2 does not exist in the set.
randomizedSet.insert(2); // Inserts 2 to the set, returns true. Set now contains [1,2].
randomizedSet.getRandom(); // getRandom() should return either 1 or 2 randomly.
randomizedSet.remove(1); // Removes 1 from the set, returns true. Set now contains [2].
randomizedSet.insert(2); // 2 was already in the set, so return false.
randomizedSet.getRandom(); // Since 2 is the only number in the set, getRandom() will always return 2.

Constraints

  • -231 <= val <= 231 - 1
  • At most 2 * 105 calls will be made to insert, remove, and getRandom.
  • There will be at least one element in the data structure when getRandom is called.

 


 

๋‚ด ์†”๋ฃจ์…˜

  • ์™œ Medium ์ด์ง€.. ์‹ถ์€ ๋ฌธ์ œ๋‹ค. 
  • array๋กœ ํ•ด๋ณผ๊นŒ ํ•˜๋‹ค๊ฐ€ ๊ทธ๋ƒฅ Set์ด ์ง€์šฐ๊ธฐ ์‰ฌ์›Œ์„œ ํ•ด๋ดค๋‹ค.
  • ๋Œ€์‹  ์ข€ ๋Š๋ฆฐ ๊ฒƒ ๊ฐ™๋‹ค.
class RandomizedSet {
  constructor() {
    this.nums = new Set();
  }
  insert(val) {
    if(this.nums.has(val)) {
      return false;
    }
    this.nums.add(val);
    return true;
  }
  remove(val) {
    if(this.nums.has(val)) {
      this.nums.delete(val)
      return true;
    }
    return false;
  }
  getRandom() {
    return [...this.nums][Math.floor(Math.random() * this.nums.size)]
  }
}

 

๊ฐ์ƒํ‰

  • ์‰ฌ์› ๋‹ค! ์˜ค๋žœ๋งŒ์— ์‰ฝ๊ณ  ์žฌ๋ฏธ์žˆ๋Š” ๊ฐ€๋ฒผ์šด ๋ฌธ์ œ
0 Comments
๋Œ“๊ธ€์“ฐ๊ธฐ ํผ