Find Triangular Sum of an Array
You are given a 0-indexed integer array nums, where nums[i] is a digit between 0 and 9 (inclusive).
The triangular sum of nums is the value of the only element present in nums after the following process terminates:
- Let
numscomprise ofnelements. Ifn == 1, end the process. Otherwise, create a new 0-indexed integer arraynewNumsof lengthn - 1. - For each index
i, where0 <= i < n - 1, assign the value ofnewNums[i]as(nums[i] + nums[i + 1]) % 10, where%denotes the modulo operator. - Replace the array
numswithnewNums. - Repeat the entire process starting from step 1.
Return the triangular sum of nums.
Example 1
Input
nums = [1,2,3,4,5]Output
8The triangular sum obtained by repeatedly replacing adjacent pairs with their sum modulo 10 is 8.
Example 2
Input
nums = [5]Output
5Since there is only one element in nums, the triangular sum is the value of that element itself.
Constraints
- 1 <= nums.length <= 1000
- 0 <= nums[i] <= 9