You are given a 0indexed 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
nums
comprise of n elements. Ifn == 1
, end the process. Otherwise, create a new 0indexed integer arraynewNums
of lengthn  1
.  For each index i, where
0 <= i < n  1
, assign the value ofnewNums[i]
as(nums[i] + nums[i+1]) % 10
, where%
denotes modulo operator.  Replace the array
nums
withnewNums
.  Repeat the entire process starting from step 1.
Return the triangular sum of nums
.
Example 1:
1 2 3 4 5
\ / \ / \ / \ /
3 5 7 9
\ / \ / \ /
8 2 6
\ / \ /
0 8
\ /
8
Input: nums = [1,2,3,4,5]
Output: 8
Explanation:
The above diagram depicts the process from which we obtain the triangular sum of the array.
Example 2:
Input: nums = [5]
Output: 5
Explanation:
Since 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

