Skip to content

Commit be7bcde

Browse files
authored
Update readme.md
1 parent 80a9c16 commit be7bcde

File tree

1 file changed

+2
-2
lines changed
  • src/main/java/g2001_2100/s2073_time_needed_to_buy_tickets

1 file changed

+2
-2
lines changed

src/main/java/g2001_2100/s2073_time_needed_to_buy_tickets/readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ You are given a **0-indexed** integer array `tickets` of length `n` where the nu
88

99
Each person takes **exactly 1 second** to buy a ticket. A person can only buy **1 ticket at a time** and has to go back to **the end** of the line (which happens **instantaneously**) in order to buy more tickets. If a person does not have any tickets left to buy, the person will **leave** the line.
1010

11-
Return _the **time taken** for the person at position_ `k`**_(0-indexed)_ **_to finish buying tickets_.
11+
Return _the **time taken** for the person at position_ `k`_**(0-indexed)** to finish buying tickets_.
1212

1313
**Example 1:**
1414

@@ -43,4 +43,4 @@ The person at position 0 has successfully bought 5 tickets and it took 4 + 1 + 1
4343
* `n == tickets.length`
4444
* `1 <= n <= 100`
4545
* `1 <= tickets[i] <= 100`
46-
* `0 <= k < n`
46+
* `0 <= k < n`

0 commit comments

Comments
 (0)