add 2073

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2073|[Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2073.java) ||Easy||
 |2070|[Most Beautiful Item for Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2070.java) ||Medium||
 |2068|[Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2068.java) ||Easy||
 |2063|[Vowels of All Substrings](https://leetcode.com/problems/vowels-of-all-substrings/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2063.java) ||Medium||

src/main/java/com/fishercoder/solutions/_2073.java

@@ -0,0 +1,27 @@
+package com.fishercoder.solutions;
+
+import java.util.Deque;
+import java.util.LinkedList;
+
+public class _2073 {
+    public static class Solution1 {
+        public int timeRequiredToBuy(int[] tickets, int k) {
+            int time = 0;
+            Deque<int[]> queue = new LinkedList<>();
+            for (int i = 0; i < tickets.length; i++) {
+                queue.addLast(new int[]{tickets[i], i});
+            }
+            while (!queue.isEmpty()) {
+                int[] curr = queue.pollFirst();
+                if (curr[0] - 1 > 0) {
+                    queue.addLast(new int[]{curr[0] - 1, curr[1]});
+                }
+                time++;
+                if (curr[1] == k && curr[0] - 1 == 0) {
+                    return time;
+                }
+            }
+            return time;
+        }
+    }
+}