超时版:
[796,575,418,309,718,324,281,833,728,104,61,486,869,540,236,177,375,312,437,242,735,47,465,53,501,945,709,829,659,841,1000,521,701,197,135,369,256,818,330,837,713,901,68,945,420,137,863,17,843,654,185,978,322,702,253,872,198,567,967,296,277,425,562,619,379,478,873]
204
public class Solution {
public int MaximumBeauty(int[] nums, int k) {
Array.Sort(nums);
int ans = 0;
int maxTvl = k << 1;
void GetAns(int left, int right)
{
if(right - left <= ans)
{
return;
}
if(left >= right)
{
return;
}
if(nums[right] - nums[left] <= maxTvl){
ans = Math.Max(ans, right - left);
return;
}
GetAns(left, right - 1);
GetAns(left + 1, right);
return;
}
GetAns(0, nums.Length - 1);
return ans + 1;
}
}