JAVA_LeetCode 1137_N-th Tribonacci Number

JAVA_LeetCode 1137_N-th Tribonacci Number 풀이 class Solution { public int tribonacci(int n) { int [] num = new int[n+1]; if(n == 0) return n; if(n == 1 || n == 2) return 1; num[0] = 0; num[1] = 1; num[2] = 1; for(int i = 3;i<=n;i++){ num[i] = num[i - 1] + num[i - 2] + num[i - 3]; } return num[n]; } } * 출처 https://leetcode.com/problems/n-th-tribonacci-number N-th Tribonacci Number - LeetCode Can you solve this real interview question? N-th Tribonacci Number - The Tribonacci sequence Tn is defined ...

원문링크 : JAVA_LeetCode 1137_N-th Tribonacci Number