打印前n个斐波那契数|集1的程序

下面是一个简单的打印程序 斐波那契数 .

null

fibonacci-sequence

例如:

Input : n = 3Output : 0 1 1Input : n = 7Output : 0 1 1 2 3 5 8

C++

// C++ program to print
// first n Fibonacci numbers
#include <bits/stdc++.h>
using namespace std;
// Function to print
// first n Fibonacci Numbers
void printFibonacciNumbers( int n)
{
int f1 = 0, f2 = 1, i;
if (n < 1)
return ;
cout << f1 << " " ;
for (i = 1; i < n; i++) {
cout << f2 << " " ;
int next = f1 + f2;
f1 = f2;
f2 = next;
}
}
// Driver Code
int main()
{
printFibonacciNumbers(7);
return 0;
}
// This code is contributed by rathbhupendra


C

// C program to print
// first n Fibonacci numbers
#include <stdio.h>
// Function to print
// first n Fibonacci Numbers
void printFibonacciNumbers( int n)
{
int f1 = 0, f2 = 1, i;
if (n < 1)
return ;
printf ( "%d " , f1);
for (i = 1; i < n; i++) {
printf ( "%d " , f2);
int next = f1 + f2;
f1 = f2;
f2 = next;
}
}
// Driver Code
int main()
{
printFibonacciNumbers(7);
return 0;
}


JAVA

// Java program to print
// first n Fibonacci Numbers
class Test {
// Method to print
// first n Fibonacci Numbers
static void printFibonacciNumbers( int n)
{
int f1 = 0 , f2 = 1 , i;
if (n < 1 )
return ;
System.out.print(f1 + " " );
for (i = 1 ; i < n; i++)
{
System.out.print(f2 + " " );
int next = f1 + f2;
f1 = f2;
f2 = next;
}
}
// Driver Code
public static void main(String[] args)
{
printFibonacciNumbers( 7 );
}
}


Python3

# Python program to print first n
# Fibonacci numbers
# Function to print first n
# Fibonacci Numbers
def printFibonacciNumbers(n):
f1 = 0
f2 = 1
if (n < 1 ):
return
print (f1, end = " " )
for x in range ( 1 , n):
print (f2, end = " " )
next = f1 + f2
f1 = f2
f2 = next
# Driven code
printFibonacciNumbers( 7 )
# This code is contributed by Danish Raza


C#

// C# program to print
// first n Fibonacci Numbers
using System;
class Test {
// Method to print
// first n Fibonacci Numbers
static void printFibonacciNumbers( int n)
{
int f1 = 0, f2 = 1, i;
if (n < 1)
return ;
Console.Write(f1 + " " );
for (i = 1; i < n; i++) {
Console.Write(f2 + " " );
int next = f1 + f2;
f1 = f2;
f2 = next;
}
}
// Driver Code
public static void Main()
{
printFibonacciNumbers(7);
}
}
// This code is contributed by nitin mittal.


PHP

<?php
// PHP program to print first
// n Fibonacci numbers
// Function to print first n
// Fibonacci Numbers
function printFibonacciNumbers( $n )
{
$f1 = 0;
$f2 = 1;
$i ;
if ( $n < 1)
return ;
echo ( $f1 );
echo ( " " );
for ( $i = 1; $i < $n ; $i ++)
{
echo ( $f2 );
echo ( " " );
$next = $f1 + $f2 ;
$f1 = $f2 ;
$f2 = $next ;
}
}
// Driver Code
printFibonacciNumbers(7);
// This code is contributed by nitin mittal
?>


Javascript

<script>
// Javascript program to print
// first n Fibonacci numbers
// Function to print
// first n Fibonacci Numbers
function printFibonacciNumbers(n)
{
let f1 = 0, f2 = 1, i;
if (n < 1)
return ;
document.write(f1 + " " );
for (i = 1; i < n; i++) {
document.write(f2 + " " );
let next = f1 + f2;
f1 = f2;
f2 = next;
}
}
// Driver Code
printFibonacciNumbers(7);
// This code is contributed by Mayank Tyagi
</script>


输出

0 1 1 2 3 5 8 

时间复杂性: O(n)

辅助空间: O(1)

如果你喜欢Geeksforgek,并且想贡献自己的力量,你也可以使用 贡献极客。组织 或者把你的文章寄去评论-team@geeksforgeeks.org.看到你的文章出现在Geeksforgeks主页上,并帮助其他极客。 如果您发现任何不正确的地方,或者您想分享有关上述主题的更多信息,请写下评论。

© 版权声明
THE END
喜欢就支持一下吧
点赞14 分享