feat: update solutions to lc problems: No.2335,2336

* No.2335.Minimum Amount of Time to Fill Cups
* No.2336.Smallest Number in Infinite Set

Author: yanglbme

solution/2300-2399/2335.Minimum Amount of Time to Fill Cups/README.md

@@ -61,6 +61,8 @@
 
 **方法一：贪心 + 排序**
 
+每次贪心地选择其中较大的两个数进行减一操作（最多减为 0），直至所有数变为 0。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -75,8 +77,7 @@ class Solution:
             amount.sort()
             ans += 1
             amount[2] -= 1
-            if amount[1]:
-                amount[1] -= 1
+            amount[1] = max(0, amount[1] - 1)
         return ans
 ```
 
@@ -92,9 +93,7 @@ class Solution {
             Arrays.sort(amount);
             ++ans;
             amount[2]--;
-            if (amount[1] > 0) {
-                amount[1]--;
-            }
+            amount[1] = Math.max(0, amount[1] - 1);
         }
         return ans;
     }
@@ -113,7 +112,7 @@ public:
             sort(amount.begin(), amount.end());
             ++ans;
             amount[2]--;
-            if (amount[1]) amount[1]--;
+            amount[1] = max(0, amount[1] - 1);
         }
         return ans;
     }

solution/2300-2399/2335.Minimum Amount of Time to Fill Cups/README_EN.md

@@ -68,8 +68,7 @@ class Solution:
             amount.sort()
             ans += 1
             amount[2] -= 1
-            if amount[1]:
-                amount[1] -= 1
+            amount[1] = max(0, amount[1] - 1)
         return ans
 ```
 
@@ -83,9 +82,7 @@ class Solution {
             Arrays.sort(amount);
             ++ans;
             amount[2]--;
-            if (amount[1] > 0) {
-                amount[1]--;
-            }
+            amount[1] = Math.max(0, amount[1] - 1);
         }
         return ans;
     }
@@ -104,7 +101,7 @@ public:
             sort(amount.begin(), amount.end());
             ++ans;
             amount[2]--;
-            if (amount[1]) amount[1]--;
+            amount[1] = max(0, amount[1] - 1);
         }
         return ans;
     }

solution/2300-2399/2335.Minimum Amount of Time to Fill Cups/Solution.cpp

@@ -7,7 +7,7 @@ class Solution {
             sort(amount.begin(), amount.end());
             ++ans;
             amount[2]--;
-            if (amount[1]) amount[1]--;
+            amount[1] = max(0, amount[1] - 1);
         }
         return ans;
     }

solution/2300-2399/2335.Minimum Amount of Time to Fill Cups/Solution.java

@@ -5,9 +5,7 @@ public int fillCups(int[] amount) {
             Arrays.sort(amount);
             ++ans;
             amount[2]--;
-            if (amount[1] > 0) {
-                amount[1]--;
-            }
+            amount[1] = Math.max(0, amount[1] - 1);
         }
         return ans;
     }

solution/2300-2399/2335.Minimum Amount of Time to Fill Cups/Solution.py

@@ -5,6 +5,5 @@ def fillCups(self, amount: List[int]) -> int:
             amount.sort()
             ans += 1
             amount[2] -= 1
-            if amount[1]:
-                amount[1] -= 1
+            amount[1] = max(0, amount[1] - 1)
         return ans

solution/2300-2399/2336.Smallest Number in Infinite Set/README.md

@@ -53,6 +53,8 @@ smallestInfiniteSet.popSmallest(); // 返回 5 ，并将其从集合中移除。
 
 **方法一：哈希表**
 
+**方法二：哈希表 + 优先队列（小根堆）**
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -76,6 +78,31 @@ class SmallestInfiniteSet:
         self.black.discard(num)
 
 
+# Your SmallestInfiniteSet object will be instantiated and called as such:
+# obj = SmallestInfiniteSet()
+# param_1 = obj.popSmallest()
+# obj.addBack(num)
+```
+
+```python
+class SmallestInfiniteSet:
+
+    def __init__(self):
+        self.h = list(range(1, 1010))
+        self.s = set(self.h)
+        heapify(self.h)
+
+    def popSmallest(self) -> int:
+        ans = heappop(self.h)
+        self.s.discard(ans)
+        return ans
+
+    def addBack(self, num: int) -> None:
+        if num not in self.s:
+            self.s.add(num)
+            heappush(self.h, num)
+
+
 # Your SmallestInfiniteSet object will be instantiated and called as such:
 # obj = SmallestInfiniteSet()
 # param_1 = obj.popSmallest()
@@ -114,6 +141,40 @@ class SmallestInfiniteSet {
  */
 ```
 
+```java
+class SmallestInfiniteSet {
+    private PriorityQueue<Integer> pq = new PriorityQueue<>();
+    private Set<Integer> s = new HashSet<>();
+
+    public SmallestInfiniteSet() {
+        for (int i = 1; i < 1010; ++i) {
+            pq.offer(i);
+            s.add(i);
+        }
+    }
+    
+    public int popSmallest() {
+        int ans = pq.poll();
+        s.remove(ans);
+        return ans;
+    }
+    
+    public void addBack(int num) {
+        if (!s.contains(num)) {
+            s.add(num);
+            pq.offer(num);
+        }
+    }
+}
+
+/**
+ * Your SmallestInfiniteSet object will be instantiated and called as such:
+ * SmallestInfiniteSet obj = new SmallestInfiniteSet();
+ * int param_1 = obj.popSmallest();
+ * obj.addBack(num);
+ */
+```
+
 ### **C++**
 
 ```cpp
@@ -145,6 +206,44 @@ public:
  */
 ```
 
+```cpp
+class SmallestInfiniteSet {
+public:
+    priority_queue<int, vector<int>, greater<int>> pq;
+    unordered_set<int> s;
+
+    SmallestInfiniteSet() {
+        for (int i = 1; i < 1010; ++i)
+        {
+            pq.push(i);
+            s.insert(i);
+        }
+    }
+    
+    int popSmallest() {
+        int ans = pq.top();
+        pq.pop();
+        s.erase(ans);
+        return ans;
+    }
+    
+    void addBack(int num) {
+        if (!s.count(num))
+        {
+            s.insert(num);
+            pq.push(num);
+        }
+    }
+};
+
+/**
+ * Your SmallestInfiniteSet object will be instantiated and called as such:
+ * SmallestInfiniteSet* obj = new SmallestInfiniteSet();
+ * int param_1 = obj->popSmallest();
+ * obj->addBack(num);
+ */
+```
+
 ### **Go**
 
 ```go
@@ -177,6 +276,54 @@ func (this *SmallestInfiniteSet) AddBack(num int) {
  */
 ```
 
+```go
+type SmallestInfiniteSet struct {
+	h *hp
+	s map[int]bool
+}
+
+func Constructor() SmallestInfiniteSet {
+	h := &hp{}
+	s := map[int]bool{}
+	for i := 1; i < 1010; i++ {
+		s[i] = true
+		h.push(i)
+	}
+	return SmallestInfiniteSet{h, s}
+}
+
+func (this *SmallestInfiniteSet) PopSmallest() int {
+	ans := this.h.pop()
+	this.s[ans] = false
+	return ans
+}
+
+func (this *SmallestInfiniteSet) AddBack(num int) {
+	if !this.s[num] {
+		this.s[num] = true
+		this.h.push(num)
+	}
+}
+
+type hp []int
+
+func (h hp) Len() int              { return len(h) }
+func (h hp) Less(i, j int) bool    { return h[i] < h[j] }
+func (h hp) Swap(i, j int)         { h[i], h[j] = h[j], h[i] }
+func (h *hp) Push(v interface{})   { *h = append(*h, v.(int)) }
+func (h *hp) Pop() (v interface{}) { a := *h; *h, v = a[:len(a)-1], a[len(a)-1]; return }
+func (h *hp) push(v int)           { heap.Push(h, v) }
+func (h *hp) pop() int             { return heap.Pop(h).(int) }
+func (h *hp) top() int             { a := *h; return a[0] }
+
+/**
+ * Your SmallestInfiniteSet object will be instantiated and called as such:
+ * obj := Constructor();
+ * param_1 := obj.PopSmallest();
+ * obj.AddBack(num);
+ */
+```
+
 ### **TypeScript**
 
 ```ts