time-needed-to-buy-tickets

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

There are <code>n</code> people in a line queuing to buy tickets, where the <code>0th</code> person is at the front of the line and the <code>(n - 1)th</code> person is at the back of the line.

You are given a 0-indexed integer array <code>tickets</code> of length <code>n</code> where the number of tickets that the <code>ith</code> person would like to buy is <code>tickets[i]</code>.

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.

Return the time taken for the person initially at position k (0-indexed) to finish buying tickets.

&nbsp;
Example 1:

<div class="example-block">
Input: tickets = [2,3,2], k = 2

Output: 6

Explanation:

<ul>
	<li>The queue starts as [2,3,2], where the kth person is underlined.</li>
	<li>After the person at the front has bought a ticket, the queue becomes [3,2,1] at 1 second.</li>
	<li>Continuing this process, the queue becomes [2,1,2] at 2 seconds.</li>
	<li>Continuing this process, the queue becomes [1,2,1] at 3 seconds.</li>
	<li>Continuing this process, the queue becomes [2,1] at 4 seconds. Note: the person at the front left the queue.</li>
	<li>Continuing this process, the queue becomes [1,1] at 5 seconds.</li>
	<li>Continuing this process, the queue becomes [1] at 6 seconds. The kth person has bought all their tickets, so return 6.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: tickets = [5,1,1,1], k = 0

Output: 8

Explanation:

<ul>
	<li>The queue starts as [5,1,1,1], where the kth person is underlined.</li>
	<li>After the person at the front has bought a ticket, the queue becomes [1,1,1,4] at 1 second.</li>
	<li>Continuing this process for 3 seconds, the queue becomes [4] at 4 seconds.</li>
	<li>Continuing this process for 4 seconds, the queue becomes [] at 8 seconds. The kth person has bought all their tickets, so return 8.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>n == tickets.length</code></li>
	<li><code>1 &lt;= n &lt;= 100</code></li>
	<li><code>1 &lt;= tickets[i] &lt;= 100</code></li>
	<li><code>0 &lt;= k &lt; n</code></li>
</ul>

timeRequiredToBuy

Time Needed to Buy Tickets

Number of Students Unable to Eat Lunch

number-of-students-unable-to-eat-lunch

无法吃午餐的学生数量

Queue

Array

Simulation

有 <code>n</code> 个人前来排队买票，其中第 <code>0</code> 人站在队伍 最前方 ，第 <code>(n - 1)</code> 人站在队伍 最后方 。

给你一个下标从 0 开始的整数数组 <code>tickets</code> ，数组长度为 <code>n</code> ，其中第 <code>i</code> 人想要购买的票数为 <code>tickets[i]</code> 。

每个人买票都需要用掉 恰好 1 秒 。一个人 一次只能买一张票 ，如果需要购买更多票，他必须走到&nbsp; 队尾 重新排队（瞬间 发生，不计时间）。如果一个人没有剩下需要买的票，那他将会 离开 队伍。

返回位于位置 <code>k</code>（下标从 0 开始）的人完成买票需要的时间（以秒为单位）。

&nbsp;

示例 1：

<div class="example-block">
输入：tickets = [2,3,2], k = 2

输出：6

解释：

<ul>
	<li>队伍一开始为 [2,3,2]，第 k 个人以下划线标识。</li>
	<li>在最前面的人买完票后，队伍在第 1 秒变成 [3,2,1]。</li>
	<li>继续这个过程，队伍在第 2 秒变为[2,1,2]。</li>
	<li>继续这个过程，队伍在第 3 秒变为[1,2,1]。</li>
	<li>继续这个过程，队伍在第 4 秒变为[2,1]。</li>
	<li>继续这个过程，队伍在第 5 秒变为[1,1]。</li>
	<li>继续这个过程，队伍在第 6 秒变为[1]。第 k 个人完成买票，所以返回 6。</li>
</ul>
</div>

示例 2：

<div class="example-block">
输入：tickets = [5,1,1,1], k = 0

输出：8

解释：

<ul>
	<li>队伍一开始为 [5,1,1,1]，第 k 个人以下划线标识。</li>
	<li>在最前面的人买完票后，队伍在第 1 秒变成 [1,1,1,4]。</li>
	<li>继续这个过程 3 秒，队伍在第 4&nbsp;秒变为[4]。</li>
	<li>继续这个过程 4 秒，队伍在第 8&nbsp;秒变为[]。第 k 个人完成买票，所以返回 8。</li>
</ul>
</div>

&nbsp;

提示：

<ul>
	<li><code>n == tickets.length</code></li>
	<li><code>1 &lt;= n &lt;= 100</code></li>
	<li><code>1 &lt;= tickets[i] &lt;= 100</code></li>
	<li><code>0 &lt;= k &lt; n</code></li>
</ul>