minimum-amount-of-time-to-fill-cups

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You have a water dispenser that can dispense cold, warm, and hot water. Every second, you can either fill up <code>2</code> cups with different types of water, or <code>1</code> cup of any type of water.

You are given a 0-indexed integer array <code>amount</code> of length <code>3</code> where <code>amount[0]</code>, <code>amount[1]</code>, and <code>amount[2]</code> denote the number of cold, warm, and hot water cups you need to fill respectively. Return the minimum number of seconds needed to fill up all the cups.

&nbsp;
Example 1:

<pre>
Input: amount = [1,4,2]
Output: 4
Explanation: One way to fill up the cups is:
Second 1: Fill up a cold cup and a warm cup.
Second 2: Fill up a warm cup and a hot cup.
Second 3: Fill up a warm cup and a hot cup.
Second 4: Fill up a warm cup.
It can be proven that 4 is the minimum number of seconds needed.
</pre>

Example 2:

<pre>
Input: amount = [5,4,4]
Output: 7
Explanation: One way to fill up the cups is:
Second 1: Fill up a cold cup, and a hot cup.
Second 2: Fill up a cold cup, and a warm cup.
Second 3: Fill up a cold cup, and a warm cup.
Second 4: Fill up a warm cup, and a hot cup.
Second 5: Fill up a cold cup, and a hot cup.
Second 6: Fill up a cold cup, and a warm cup.
Second 7: Fill up a hot cup.
</pre>

Example 3:

<pre>
Input: amount = [5,0,0]
Output: 5
Explanation: Every second, we fill up a cold cup.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>amount.length == 3</code></li>
	<li><code>0 &lt;= amount[i] &lt;= 100</code></li>
</ul>

fillCups

Minimum Amount of Time to Fill Cups

Construct Target Array With Multiple Sums

construct-target-array-with-multiple-sums

多次求和构造目标数组

Maximum Score From Removing Stones

maximum-score-from-removing-stones

移除石子的最大得分

Maximum Running Time of N Computers

maximum-running-time-of-n-computers

同时运行 N 台电脑的最长时间

Minimum Cost to Make Array Equal

minimum-cost-to-make-array-equal

使数组相等的最小开销

Greedy

Array

Sorting

Heap (Priority Queue)

现有一台饮水机，可以制备冷水、温水和热水。每秒钟，可以装满 <code>2</code> 杯 不同 类型的水或者 <code>1</code> 杯任意类型的水。

给你一个下标从 0 开始、长度为 <code>3</code> 的整数数组 <code>amount</code> ，其中 <code>amount[0]</code>、<code>amount[1]</code> 和 <code>amount[2]</code> 分别表示需要装满冷水、温水和热水的杯子数量。返回装满所有杯子所需的 最少 秒数。

&nbsp;

示例 1：

<pre>输入：amount = [1,4,2]
输出：4
解释：下面给出一种方案：
第 1 秒：装满一杯冷水和一杯温水。
第 2 秒：装满一杯温水和一杯热水。
第 3 秒：装满一杯温水和一杯热水。
第 4 秒：装满一杯温水。
可以证明最少需要 4 秒才能装满所有杯子。
</pre>

示例 2：

<pre>输入：amount = [5,4,4]
输出：7
解释：下面给出一种方案：
第 1 秒：装满一杯冷水和一杯热水。
第 2 秒：装满一杯冷水和一杯温水。
第 3 秒：装满一杯冷水和一杯温水。
第 4 秒：装满一杯温水和一杯热水。
第 5 秒：装满一杯冷水和一杯热水。
第 6 秒：装满一杯冷水和一杯温水。
第 7 秒：装满一杯热水。
</pre>

示例 3：

<pre>输入：amount = [5,0,0]
输出：5
解释：每秒装满一杯冷水。
</pre>

&nbsp;

提示：

<ul>
	<li><code>amount.length == 3</code></li>
	<li><code>0 &lt;= amount[i] &lt;= 100</code></li>
</ul>