First Unique Number
|Last edited: 2024-5-9
ID
1429
Data Type
Queue
Difficulty
Medium
Tags
Hash Table
URL
https://leetcode.com/problems/first-unique-number
Completed Date
Preference
💸😭 Poverty Tears
You have a queue of integers, you need to retrieve the first unique integer in the queue.
Implement the FirstUnique class:
  • FirstUnique(int[] nums) Initializes the object with the numbers in the queue.
  • int showFirstUnique() returns the value of the first unique integer of the queue, and returns 1 if there is no such integer.
  • void add(int value) insert value to the queue.
Example 1:
Example 2:
Example 3:
Constraints:
  • 1 <= nums.length <= 10^5
  • 1 <= nums[i] <= 10^8
  • 1 <= value <= 10^8
  • At most 50000 calls will be made to showFirstUnique and add.
 

题解