Java Tribonacci 数

2025年3月17日 | 阅读 3 分钟

在本节中，我们将学习什么是特里博纳契数，还将创建计算特里博纳契数的Java 程序。特里博纳契数程序经常出现在 Java 编码面试和学术中。

特里博纳契数

特里博纳契数与斐波那契数相同。通过将前三项相加，我们可以得到特里博纳契数。前三项是a(0) = a(1) = 0，a(2) = 1。它是 OEIS 序列A000073。

通过使用这三项，我们可以计算下一个特里博纳契数。特里博纳契数的通用公式是

特里博纳契数示例

前几个特里博纳契数是 0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81, 149, 274, 504, 927, 1705, 3136, 5768, 10609, 19513, 35890, 66012, 121415, 223317, 410744, 755476, 1389537, 2555757, 4700770。

算法

tribonacci(n):
Begin
   first := 0, second := 1, third := 1
   print first, second, third
   for i in range n - 3, do
      next := first + second + third
      print next
      first := second
      second := third
      third := next
   done
End

使用递归计算特里博纳契数的 Java 程序

TribonacciNumbers.java

public class TribonacciNumbers
{
//function to calculate Tribonacci number
    static int printTribRec(int n)
    {
        if (n == 2 || n == 0 || n == 1)
        //returns 0 if the user enter 0, 1, and 2nd term of the series
            return 0;
        if (n == 3)
            return 1;
        else
            //calculates and returns the next term of the series
            return printTribRec(n - 1) + printTribRec(n - 2) + printTribRec(n - 3);
    }
    //
    static void printTrib(int n)
    {
        //loop executes up to n times,means that the function called n times and prints the number
        for (int i = 1; i < n; i++)
            System.out.print(printTribRec(i)+" ");
    }
    //driver code
    public static void main(String args[])
    {
        int n = 10;
        //function calling
        printTrib(n);
    }
}

输出

0 0 1 1 2 4 7 13 24 44 81 149 274 504 927 1705 3136 5768 10609

因此，我们可以说由特里博纳契数列生成的项称为特里博纳契数。

求特里博纳契数列的第 N 个数

NthTribonacciNumber.java

import java.util.*;   
public class NthTribonacciNumber
{  
//method to calculate Tribonnaci number
public static int tribonacciTerm(int n)   
{  
if (n < 3)   
return n;  
//initializing the first three terms of the Tribonnaci series so that we can calculate the next term
int a = 0, b = 1, c = 1, d;  
//in the while loop --> is not an operator. These are two separate operators, -- and >.  
//the conditional's code decrements n by 1, while returning n's original value not decremented value  
//after that compares the original value with 3 using the > operator
//more specifically we can write it as while ((n--) > 3)     
while (n-- > 3)     
{  
d = a + b + c;  
a = b;  
b = c;  
c = d;  
}  
return c;  
}  
public static void main(String args[])   
{  
Scanner sc = new Scanner(System.in);  
System.out.print("Enter the term: ");  
//reads an integer from the user   
int n=sc.nextInt();  
//function calling  
int ans=tribonacciTerm(n);   
System.out.println("The "+n+"th term of the Tribonacci series is: "+ans);  
}  
}  

输出

Enter the term: 12
12th Tribonacci number is: 274

下一个主题Java 中的伯努利数

← 上一个下一个 →

Java Tribonacci 数

特里博纳契数

特里博纳契数示例

算法

使用递归计算特里博纳契数的 Java 程序

求特里博纳契数列的第 N 个数

联系信息

关注我们

教程

面试题

在线编译器

Python

Java

.Net Framework

AI, ML and Data Science

Cloud Technology

B.Tech and MCA

Web Technology

PHP

Software Testing

Technical Interview

Java Interview

Python

Web Interview

Database Interview

B.Tech / MCA

Important Interview

Software Testing Interview

Company Interviews

Online Compilers

Multiple Choice Questions

Java Conversion

Java Misc

Java Tribonacci 数

特里博纳契数

特里博纳契数示例

算法

使用递归计算特里博纳契数的 Java 程序

求特里博纳契数列的第 N 个数

相关帖子

Java 游戏

How to Compile and Run Java Program

Primitive Data Types in Java

Java AWS Lambda

Java String.valueOf() 方法

Java 21 中的序列化集合

Java 中的方法类型

Java Program to Find How Many Fish (N Voracious Fish) Are Alive Moving Along a River | Codility Fish Solution

Resolving Conflicts During Multiple Inheritance in Java

Java 中从日期获取年份

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器