package com.fishercoder.solutions;

/**
 * 1137. N-th Tribonacci Number
 *
 * The Tribonacci sequence Tn is defined as follows:
 *
 * T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0.
 *
 * Given n, return the value of Tn.
 *
 * Example 1:
 * Input: n = 4
 * Output: 4
 *
 * Explanation:
 * T_3 = 0 + 1 + 1 = 2
 * T_4 = 1 + 1 + 2 = 4
 *
 * Example 2:
 * Input: n = 25
 * Output: 1389537
 *
 * Constraints:
 * 0 <= n <= 37
 * The answer is guaranteed to fit within a 32-bit integer, ie. answer <= 2^31 - 1.
 * */
public class _1137 {
    public static class Solution1 {
        public int tribonacci(int n) {
            if (n <= 1) {
                return n;
            }
            int[] numbers = new int[n + 1];
            numbers[0] = 0;
            numbers[1] = 1;
            numbers[2] = 1;
            for (int i = 3; i <= n; i++) {
                numbers[i] = numbers[i - 1] + numbers[i - 2] + numbers[i - 3];
            }
            return numbers[n];
        }
    }
}

@@ -29,16 +29,52 @@
 tions;%0A%0A
+import java.util.stream.IntStream;%0A%0A
 /**%0A * 1
@@ -861,54 +861,48 @@
     
-for (int i = 3; i %3C= n; i++) %7B%0A               
+IntStream.rangeClosed(3, n).forEach(i -%3E
  num
@@ -959,31 +959,18 @@
 s%5Bi - 3%5D
+)
 ;
-%0A            %7D
 %0A       

refactor 1137