Find Triangular Sum of an Array LeetCode solution in C++

1
class Solution {
2
 public:
3
  int triangularSum(vector<int> &nums) {
4
    int n = nums.size();
5
    for (int i = n - 1; i >= 1; i--) {
6
      for (int j = 0; j < i; j++) {
7
        nums[j] = (nums[j] + nums[j + 1]) % 10;
8
      }
9
    }
10
    return nums[0];
11
  }
12
};