时间轴

2025-10-01

init

题目：

P2221 数组的三角和

https://leetcode.cn/problems/find-triangular-sum-of-an-array/description/?envType=daily-question&envId=2025-10-01

数学模拟

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <vector>
using std::vector;

class Solution {
public:
  int triangularSum(vector<int> &nums) {
    int i;
    int bound;
    int n = nums.size();

    for (int k = 0; k < n; k++) {
      i = 0;
      bound = n - k;
      while (i < bound - 1) {
        nums[i] = (nums[i] + nums[i + 1]) % 10;
        i++;
      }
    }
    return nums[0];
  }
};