leetcode 2221. Find Triangular Sum of an Array

class Solution:
    def triangularSum(self, nums: List[int]) -> int:
        for j in range(len(nums)-1):
            tmp=[]
            for i in range(1,len(nums)):
                tmp.append( (nums[i]+nums[i-1])%10 )
            nums=tmp
        return(nums[0])