feat: add solutions to lc problem: No.2221

No.2221.Find Triangular Sum of an Array

Author: yanglbme

solution/2200-2299/2221.Find Triangular Sum of an Array/README.md

@@ -59,15 +59,60 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def triangularSum(self, nums: List[int]) -> int:
+        n = len(nums)
+        for i in range(n, 0, -1):
+            for j in range(i - 1):
+                nums[j] = (nums[j] + nums[j + 1]) % 10
+        return nums[0]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int triangularSum(int[] nums) {
+        int n = nums.length;
+        for (int i = n; i >= 0; --i) {
+            for (int j = 0; j < i - 1; ++j) {
+                nums[j] = (nums[j] + nums[j + 1]) % 10;
+            }
+        }
+        return nums[0];
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int triangularSum(vector<int>& nums) {
+        int n = nums.size();
+        for (int i = n; i >= 0; --i)
+            for (int j = 0; j < i - 1; ++j)
+                nums[j] = (nums[j] + nums[j + 1]) % 10;
+        return nums[0];
+    }
+};
+```
 
+### **Go**
+
+```go
+func triangularSum(nums []int) int {
+	n := len(nums)
+	for i := n; i >= 0; i-- {
+		for j := 0; j < i-1; j++ {
+			nums[j] = (nums[j] + nums[j+1]) % 10
+		}
+	}
+	return nums[0]
+}
 ```
 
 ### **TypeScript**

solution/2200-2299/2221.Find Triangular Sum of an Array/README_EN.md

@@ -49,13 +49,58 @@ Since there is only one element in nums, the triangular sum is the value of that
 ### **Python3**
 
 ```python
-
+class Solution:
+    def triangularSum(self, nums: List[int]) -> int:
+        n = len(nums)
+        for i in range(n, 0, -1):
+            for j in range(i - 1):
+                nums[j] = (nums[j] + nums[j + 1]) % 10
+        return nums[0]
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int triangularSum(int[] nums) {
+        int n = nums.length;
+        for (int i = n; i >= 0; --i) {
+            for (int j = 0; j < i - 1; ++j) {
+                nums[j] = (nums[j] + nums[j + 1]) % 10;
+            }
+        }
+        return nums[0];
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int triangularSum(vector<int>& nums) {
+        int n = nums.size();
+        for (int i = n; i >= 0; --i)
+            for (int j = 0; j < i - 1; ++j)
+                nums[j] = (nums[j] + nums[j + 1]) % 10;
+        return nums[0];
+    }
+};
+```
 
+### **Go**
+
+```go
+func triangularSum(nums []int) int {
+	n := len(nums)
+	for i := n; i >= 0; i-- {
+		for j := 0; j < i-1; j++ {
+			nums[j] = (nums[j] + nums[j+1]) % 10
+		}
+	}
+	return nums[0]
+}
 ```
 
 ### **TypeScript**

solution/2200-2299/2221.Find Triangular Sum of an Array/Solution.cpp

@@ -0,0 +1,10 @@
+class Solution {
+public:
+    int triangularSum(vector<int>& nums) {
+        int n = nums.size();
+        for (int i = n; i >= 0; --i)
+            for (int j = 0; j < i - 1; ++j)
+                nums[j] = (nums[j] + nums[j + 1]) % 10;
+        return nums[0];
+    }
+};

solution/2200-2299/2221.Find Triangular Sum of an Array/Solution.go

@@ -0,0 +1,9 @@
+func triangularSum(nums []int) int {
+	n := len(nums)
+	for i := n; i >= 0; i-- {
+		for j := 0; j < i-1; j++ {
+			nums[j] = (nums[j] + nums[j+1]) % 10
+		}
+	}
+	return nums[0]
+}

solution/2200-2299/2221.Find Triangular Sum of an Array/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int triangularSum(int[] nums) {
+        int n = nums.length;
+        for (int i = n; i >= 0; --i) {
+            for (int j = 0; j < i - 1; ++j) {
+                nums[j] = (nums[j] + nums[j + 1]) % 10;
+            }
+        }
+        return nums[0];
+    }
+}

solution/2200-2299/2221.Find Triangular Sum of an Array/Solution.py

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