如何从排序的Ruby数组中删除比限制更接近其最近邻居的所有元素？

def remove_elements(array, limit)
  while true
    min_diff = Float::INFINITY
    min_index = -1

    # 找到差值最小的元素
    array.each_with_index do |num, index|
      next if index == 0 || index == array.length - 1

      diff = (num - array[index-1]).abs
      if diff < min_diff
        min_diff = diff
        min_index = index
      end
    end

    break if min_diff > limit

    # 确定删除的范围
    left_diff = (array[min_index] - array[min_index-1]).abs
    right_diff = (array[min_index] - array[min_index+1]).abs

    if left_diff < right_diff
      start_index = min_index - 1
      end_index = min_index
    else
      start_index = min_index
      end_index = min_index + 1
    end

    # 删除范围内的元素
    array.slice!(start_index..end_index)
  end

  return array
end

# 示例用法
sorted_array = [1, 3, 5, 7, 9, 11, 13, 15]
limit = 2
result = remove_elements(sorted_array, limit)
puts result.inspect