add 1845

fishercoder1534 · fishercoder1534 · commit 88dd14afacc2 · 2021-05-01T19:06:27.000-07:00
diff --git a/README.md b/README.md
@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
-|1844|[Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters//)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1844.java) ||Easy|String|
+|1845|[Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1845.java) ||Medium|Heap, Design|
+|1844|[Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1844.java) ||Easy|String|
 |1837|[Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1837.java) ||Easy|Math, Bit Manipulation|
 |1833|[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1833.java) ||Medium|Array, Sort|
 |1832|[Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1832.java) ||Easy|String|
diff --git a/src/main/java/com/fishercoder/solutions/_1845.java b/src/main/java/com/fishercoder/solutions/_1845.java
@@ -0,0 +1,31 @@
+package com.fishercoder.solutions;
+
+public class _1845 {
+    public static class Solution1 {
+        class SeatManager {
+            boolean[] seats;
+            int next;
+
+            public SeatManager(int n) {
+                seats = new boolean[n + 1];
+                next = 1;
+            }
+
+            public int reserve() {
+                seats[next] = true;
+                int tmp = next;
+                while (next < seats.length && seats[next]) {
+                    next++;
+                }
+                return tmp;
+            }
+
+            public void unreserve(int seatNumber) {
+                seats[seatNumber] = false;
+                if (next > seatNumber) {
+                    next = seatNumber;
+                }
+            }
+        }
+    }
+}
