LeedCode1480. Dynamic sum of one-dimensional array

Give you an array nums . Array 「 Dynamic and 」 The calculation formula of is ：runningSum[i] = sum(nums[0]…nums[i]) .

Please return nums Dynamic and .

Example 1：

Input ：nums = [1,2,3,4]
Output ：[1,3,6,10]
explain ： The dynamic and computational process is [1, 1+2, 1+2+3, 1+2+3+4] .
Example 2：

Input ：nums = [1,1,1,1,1]
Output ：[1,2,3,4,5]
explain ： The dynamic and computational process is [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+1] .
Example 3：

Input ：nums = [3,1,2,10,1]
Output ：[3,4,6,16,17]

source ： Power button （LeetCode）
link ：https://leetcode.cn/problems/running-sum-of-1d-array
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .

Then my C# The code is

   public class Solution
    {
    
        public int[] RunningSum(int[] nums)
        {
    
            int length = nums.Length;
            int[] newInt = new int[length];
            for(int i=0;i<nums.Length;i++)
            {
    
                int index = i;
                int tempsum = 0;
                for(int k=0;k<index+1;k++)
                {
    
                    tempsum += nums[k];
                    newInt[index] = tempsum;
                }
              
            }
            return newInt;


        }
    }