等差数列求和公式：求解《829. 连续整数求和》

var consecutiveNumbersSum = function(n) {
  // n = (x + x + k - 1) * k / 2 -> k * x = n - (0 + k - 1) * k / 2
  let sum = r = 0
  for (let k = 1; sum < n; k++) {
    if ((n - sum) % k === 0) r++
    sum += k
  }
  return r
};

function consecutiveNumbersSum(n: number): number {
  let sum = 0, r = 0
  for (let k = 1; sum < n; k++) {
    if ((n - sum) % k === 0) r++
    sum += k
  }
  return r
};

class Solution {
  function consecutiveNumbersSum($n) {
    $sum = $r = 0;
    for ($k = 1; $sum < $n; $k++) {
      if (($n - $sum) % $k === 0) $r++;
      $sum += $k;
    }
    return $r;
  }
}

func consecutiveNumbersSum(n int) int {
  sum, r := 0, 0
  for k := 1; sum < n; k++ {
    if (n - sum) % k == 0 {
      r++
    }
    sum += k
  }
  return r
}

class Solution {
  public int consecutiveNumbersSum(int n) {
    int sum = 0, r = 0;
    for (int k = 1; sum < n; k++) {
      if ((n - sum) % k == 0) r++;
      sum += k;
    }
    return r;
  }
}

class Solution:
  def consecutiveNumbersSum(self, n: int) -> int:
    sum, r, k = 0, 0, 1
    while sum < n:
      if (n - sum) % k == 0: r += 1
      sum += k
      k += 1
    return r

def consecutive_numbers_sum(n)
  sum = r = 0
  k = 1
  while sum < n do
    if (n - sum) % k == 0 then
      r += 1
    end
    sum += k
    k += 1
  end
  return r
end

int consecutiveNumbersSum(int n){
  int sum = 0, r = 0;
  for (int k = 1; sum < n; k++) {
    if ((n - sum) % k == 0) r++;
    sum += k;
  }
  return r;
}

public class Solution {
  public int ConsecutiveNumbersSum(int n) {
    int sum = 0, r = 0;
    for (int k = 1; sum < n; k++) {
      if ((n - sum) % k == 0) r++;
      sum += k;
    }
    return r;
  }
}

class Solution {
public:
  int consecutiveNumbersSum(int n) {
    int sum = 0, r = 0;
    for (int k = 1; sum < n; k++) {
      if ((n - sum) % k == 0) r++;
      sum += k;
    }
    return r;
  }
};