maximum-tastiness-of-candy-basket

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 are given an array of positive integers <code>price</code> where <code>price[i]</code> denotes the price of the <code>ith</code> candy and a positive integer <code>k</code>.

The store sells baskets of <code>k</code> distinct candies. The tastiness of a candy basket is the smallest absolute difference of the prices of any two candies in the basket.

Return the maximum tastiness of a candy basket.

&nbsp;
Example 1:

<pre>
Input: price = [13,5,1,8,21,2], k = 3
Output: 8
Explanation: Choose the candies with the prices [13,5,21].
The tastiness of the candy basket is: min(|13 - 5|, |13 - 21|, |5 - 21|) = min(8, 8, 16) = 8.
It can be proven that 8 is the maximum tastiness that can be achieved.
</pre>

Example 2:

<pre>
Input: price = [1,3,1], k = 2
Output: 2
Explanation: Choose the candies with the prices [1,3].
The tastiness of the candy basket is: min(|1 - 3|) = min(2) = 2.
It can be proven that 2 is the maximum tastiness that can be achieved.
</pre>

Example 3:

<pre>
Input: price = [7,7,7,7], k = 2
Output: 0
Explanation: Choosing any two distinct candies from the candies we have will result in a tastiness of 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= k &lt;= price.length &lt;= 105</code></li>
	<li><code>1 &lt;= price[i] &lt;= 109</code></li>
</ul>

maximumTastiness

Maximum Tastiness of Candy Basket

Container With Most Water

container-with-most-water

盛最多水的容器

Sliding Window Maximum

sliding-window-maximum

滑动窗口最大值

Greedy

Array

Binary Search

Sorting

给你一个正整数数组 <code>price</code> ，其中 <code>price[i]</code> 表示第 <code>i</code> 类糖果的价格，另给你一个正整数 <code>k</code> 。

商店组合 <code>k</code> 类 不同 糖果打包成礼盒出售。礼盒的 甜蜜度 是礼盒中任意两种糖果 价格 绝对差的最小值。

返回礼盒的 最大 甜蜜度。

&nbsp;

示例 1：

<pre>
输入：price = [13,5,1,8,21,2], k = 3
输出：8
解释：选出价格分别为 [13,5,21] 的三类糖果。
礼盒的甜蜜度为 min(|13 - 5|, |13 - 21|, |5 - 21|) = min(8, 8, 16) = 8 。
可以证明能够取得的最大甜蜜度就是 8 。
</pre>

示例 2：

<pre>
输入：price = [1,3,1], k = 2
输出：2
解释：选出价格分别为 [1,3] 的两类糖果。 
礼盒的甜蜜度为 min(|1 - 3|) = min(2) = 2 。
可以证明能够取得的最大甜蜜度就是 2 。
</pre>

示例 3：

<pre>
输入：price = [7,7,7,7], k = 2
输出：0
解释：从现有的糖果中任选两类糖果，甜蜜度都会是 0 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= k &lt;= price.length &lt;= 105</code></li>
	<li><code>1 &lt;= price[i] &lt;= 109</code></li>
</ul>