Package g2201_2300.s2221_find_triangular_sum_of_an_array

Class Solution

java.lang.Object

g2201_2300.s2221_find_triangular_sum_of_an_array.Solution

public class Solution
extends Object

2221 - Find Triangular Sum of an Array.<p>Medium</p> <p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>, where <code>nums[i]</code> is a digit between <code>0</code> and <code>9</code> ( <strong>inclusive</strong> ).</p> <p>The <strong>triangular sum</strong> of <code>nums</code> is the value of the only element present in <code>nums</code> after the following process terminates:</p> <ol> <li>Let <code>nums</code> comprise of <code>n</code> elements. If <code>n == 1</code>, <strong>end</strong> the process. Otherwise, <strong>create</strong> a new <strong>0-indexed</strong> integer array <code>newNums</code> of length <code>n - 1</code>.</li> <li>For each index <code>i</code>, where <code>0 <= i < n - 1</code>, <strong>assign</strong> the value of <code>newNums[i]</code> as <code>(nums[i] + nums[i+1]) % 10</code>, where <code>%</code> denotes modulo operator.</li> <li><strong>Replace</strong> the array <code>nums</code> with <code>newNums</code>.</li> <li><strong>Repeat</strong> the entire process starting from step 1.</li> </ol> <p>Return <em>the triangular sum of</em> <code>nums</code>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2022/02/22/ex1drawio.png" alt="" /></p> <p><strong>Input:</strong> nums = [1,2,3,4,5]</p> <p><strong>Output:</strong> 8</p> <p><strong>Explanation:</strong> The above diagram depicts the process from which we obtain the triangular sum of the array.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [5]</p> <p><strong>Output:</strong> 5</p> <p><strong>Explanation:</strong> Since there is only one element in nums, the triangular sum is the value of that element itself.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 1000</code></li> <li><code>0 <= nums[i] <= 9</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	triangularSum(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

triangularSum

public int triangularSum(int[] nums)