查找列表中两个整数之间的最大增量 [英] Finding the largest delta between two integers in a list

问题描述

我有一个整数列表，即:

I have a list of integers, i.e.:

values = [55, 55, 56, 57, 57, 57, 57, 62, 63, 64, 79, 80]

我正试图找出两个连续数字之间最大的差异.

I am trying to find the largest difference between two consecutive numbers.

在这种情况下，它应该是 64-> 79 中的 15 .

In this case it would be 15 from 64->79.

数字可以是负数，也可以是正数，可以是增加或减少的数字，也可以是两者都可以.重要的是我需要找到两个连续数字之间的最大增量.

The numbers can be negative or positive, increasing or decreasing or both. The important thing is I need to find the largest delta between two consecutive numbers.

最快的方法是什么?这些列表可以包含数百到数千个整数.

What is the fastest way to do this? These lists can contain anywhere from hundreds to thousands of integers.

这是我现在拥有的代码:

This is the code I have right now:

prev_value = values[0]
largest_delta = 0

for value in values:
  delta = value - prev_value
  if delta > largest_delta:
    largest_delta = delta
  prev_value = value

  return largest_delta

有更快的方法吗?需要一段时间.

Is there a faster way to do this? It takes a while.

推荐答案

max(abs(x - y) for (x, y) in zip(values[1:], values[:-1]))

这篇关于查找列表中两个整数之间的最大增量的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！