#include <leetcode.h>
◆ numberOfArithmeticSlices()
int leetcode::arithmetic_slices::Solution::numberOfArithmeticSlices |
( |
vector< int > & |
nums | ) |
|
|
static |
在文件 leetcode.cpp 第 6632 行定义.
6633 const int n = nums.size();
6634 vector<int> diff(n - 1);
6635 for(
int i = 0; i < n - 1; i++) {
6636 diff[i] = nums[i + 1] - nums[i];
6638 vector<int> consecutive;
6641 for(
int i = 0; i < n - 1; i++) {
6642 if(diff[i] == diff[prev]) {
6645 consecutive.emplace_back(cnt);
6650 consecutive.emplace_back(cnt);
6652 for(
const auto num: consecutive) {
6654 ans += (num - 1) * num / 2;
被这些函数引用 leetcode::arithmetic_slices::TEST().
该类的文档由以下文件生成: