mirror of
				https://gitee.com/coder-xiaomo/leetcode-problemset
				synced 2025-11-04 03:33:12 +08:00 
			
		
		
		
	
		
			
				
	
	
		
			40 lines
		
	
	
		
			1.9 KiB
		
	
	
	
		
			HTML
		
	
	
	
	
	
			
		
		
	
	
			40 lines
		
	
	
		
			1.9 KiB
		
	
	
	
		
			HTML
		
	
	
	
	
	
<p>You are given an array <code>time</code> where <code>time[i]</code> denotes the time taken by the <code>i<sup>th</sup></code> bus to complete <strong>one trip</strong>.</p>
 | 
						|
 | 
						|
<p>Each bus can make multiple trips <strong>successively</strong>; that is, the next trip can start <strong>immediately after</strong> completing the current trip. Also, each bus operates <strong>independently</strong>; that is, the trips of one bus do not influence the trips of any other bus.</p>
 | 
						|
 | 
						|
<p>You are also given an integer <code>totalTrips</code>, which denotes the number of trips all buses should make <strong>in total</strong>. Return <em>the <strong>minimum time</strong> required for all buses to complete <strong>at least</strong> </em><code>totalTrips</code><em> trips</em>.</p>
 | 
						|
 | 
						|
<p> </p>
 | 
						|
<p><strong class="example">Example 1:</strong></p>
 | 
						|
 | 
						|
<pre>
 | 
						|
<strong>Input:</strong> time = [1,2,3], totalTrips = 5
 | 
						|
<strong>Output:</strong> 3
 | 
						|
<strong>Explanation:</strong>
 | 
						|
- At time t = 1, the number of trips completed by each bus are [1,0,0]. 
 | 
						|
  The total number of trips completed is 1 + 0 + 0 = 1.
 | 
						|
- At time t = 2, the number of trips completed by each bus are [2,1,0]. 
 | 
						|
  The total number of trips completed is 2 + 1 + 0 = 3.
 | 
						|
- At time t = 3, the number of trips completed by each bus are [3,1,1]. 
 | 
						|
  The total number of trips completed is 3 + 1 + 1 = 5.
 | 
						|
So the minimum time needed for all buses to complete at least 5 trips is 3.
 | 
						|
</pre>
 | 
						|
 | 
						|
<p><strong class="example">Example 2:</strong></p>
 | 
						|
 | 
						|
<pre>
 | 
						|
<strong>Input:</strong> time = [2], totalTrips = 1
 | 
						|
<strong>Output:</strong> 2
 | 
						|
<strong>Explanation:</strong>
 | 
						|
There is only one bus, and it will complete its first trip at t = 2.
 | 
						|
So the minimum time needed to complete 1 trip is 2.
 | 
						|
</pre>
 | 
						|
 | 
						|
<p> </p>
 | 
						|
<p><strong>Constraints:</strong></p>
 | 
						|
 | 
						|
<ul>
 | 
						|
	<li><code>1 <= time.length <= 10<sup>5</sup></code></li>
 | 
						|
	<li><code>1 <= time[i], totalTrips <= 10<sup>7</sup></code></li>
 | 
						|
</ul>
 |