Find Triangular Sum of an Array LeetCode solution in Java

1
class Solution {
2
  public int triangularSum(int[] nums) {
3
    return find(nums, nums.length);
4
  }
5

6
  public int find(int[] a, int n) {
7
    if (n == 1) return a[0];
8

9
    for (int i = 0; i < n - 1; i++) {
10
      a[i] = (a[i] + a[i + 1]) % 10;
11
    }
12
    return find(a, n - 1);
13
  }
14
}