Sync LeetCode submission Runtime - 543 ms (82.32%), Memory - 61.3 MB (49.31%)

Author: jimit105

1366-first-unique-number/README.md

@@ -0,0 +1,73 @@
+<p>You have a queue of integers, you need to retrieve the first unique integer in the queue.</p>
+
+<p>Implement the <code>FirstUnique</code>&nbsp;class:</p>
+
+<ul>
+	<li><code>FirstUnique(int[] nums)</code> Initializes the object with the numbers in the queue.</li>
+	<li><code>int showFirstUnique()</code>&nbsp;returns the value of <strong>the&nbsp;first unique</strong> integer of the queue, and returns <strong>-1</strong> if there is no such integer.</li>
+	<li><code>void add(int value)</code>&nbsp;insert value&nbsp;to&nbsp;the queue.</li>
+</ul>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<b>Input: </b>
+[&quot;FirstUnique&quot;,&quot;showFirstUnique&quot;,&quot;add&quot;,&quot;showFirstUnique&quot;,&quot;add&quot;,&quot;showFirstUnique&quot;,&quot;add&quot;,&quot;showFirstUnique&quot;]
+[[[2,3,5]],[],[5],[],[2],[],[3],[]]
+<b>Output: </b>
+[null,2,null,2,null,3,null,-1]
+<b>Explanation: </b>
+FirstUnique firstUnique = new FirstUnique([2,3,5]);
+firstUnique.showFirstUnique(); // return 2
+firstUnique.add(5);            // the queue is now [2,3,5,5]
+firstUnique.showFirstUnique(); // return 2
+firstUnique.add(2);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // the queue is now [2,3,5,5,2]
+firstUnique.showFirstUnique(); // return 3
+firstUnique.add(3);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // the queue is now [2,3,5,5,2,3]
+firstUnique.showFirstUnique(); // return -1
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<b>Input: </b>
+[&quot;FirstUnique&quot;,&quot;showFirstUnique&quot;,&quot;add&quot;,&quot;add&quot;,&quot;add&quot;,&quot;add&quot;,&quot;add&quot;,&quot;showFirstUnique&quot;]
+[[[7,7,7,7,7,7]],[],[7],[3],[3],[7],[17],[]]
+<b>Output: </b>
+[null,-1,null,null,null,null,null,17]
+<b>Explanation: </b>
+FirstUnique firstUnique = new FirstUnique([7,7,7,7,7,7]);
+firstUnique.showFirstUnique(); // return -1
+firstUnique.add(7);            // the queue is now [7,7,7,7,7,7,7]
+firstUnique.add(3);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // the queue is now [7,7,7,7,7,7,7,3]
+firstUnique.add(3);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // the queue is now [7,7,7,7,7,7,7,3,3]
+firstUnique.add(7);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // the queue is now [7,7,7,7,7,7,7,3,3,7]
+firstUnique.add(17);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;// the queue is now [7,7,7,7,7,7,7,3,3,7,17]
+firstUnique.showFirstUnique(); // return 17
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<b>Input: </b>
+[&quot;FirstUnique&quot;,&quot;showFirstUnique&quot;,&quot;add&quot;,&quot;showFirstUnique&quot;]
+[[[809]],[],[809],[]]
+<b>Output: </b>
+[null,809,null,-1]
+<b>Explanation: </b>
+FirstUnique firstUnique = new FirstUnique([809]);
+firstUnique.showFirstUnique(); // return 809
+firstUnique.add(809);          // the queue is now [809,809]
+firstUnique.showFirstUnique(); // return -1
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10^5</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10^8</code></li>
+	<li><code>1 &lt;= value &lt;= 10^8</code></li>
+	<li>At most <code>50000</code>&nbsp;calls will be made to <code>showFirstUnique</code>&nbsp;and <code>add</code>.</li>
+</ul>

1366-first-unique-number/solution.py

@@ -0,0 +1,35 @@
+# Approach 2: Queue and HashMap of Unique-Status
+
+from collections import deque
+
+class FirstUnique:
+
+    def __init__(self, nums: List[int]):
+        self.queue = deque(nums)
+        self.is_unique = {}
+        for num in nums:
+            self.add(num)
+        
+
+    def showFirstUnique(self) -> int:
+        while self.queue and not self.is_unique[self.queue[0]]:
+            self.queue.popleft()
+
+        if self.queue:
+            return self.queue[0]
+        return -1
+        
+
+    def add(self, value: int) -> None:
+        if value not in self.is_unique:
+            self.is_unique[value] = True
+            self.queue.append(value)
+        else:
+            self.is_unique[value] = False
+        
+
+
+# Your FirstUnique object will be instantiated and called as such:
+# obj = FirstUnique(nums)
+# param_1 = obj.showFirstUnique()
+# obj.add(value)