๐๊ณต๋ถ/์ฝ๋ฉํ
์คํธ
ํ๋ก๊ทธ๋๋จธ์ค - ํผ๋ณด๋์น ์, ํ์ด์ฌ & C++
Janger
2021. 11. 22. 22:16
728x90
https://programmers.co.kr/learn/courses/30/lessons/12945
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ํผ๋ณด๋์น ์
ํผ๋ณด๋์น ์๋ F(0) = 0, F(1) = 1์ผ ๋, 1 ์ด์์ n์ ๋ํ์ฌ F(n) = F(n-1) + F(n-2) ๊ฐ ์ ์ฉ๋๋ ์ ์ ๋๋ค. ์๋ฅผ๋ค์ด F(2) = F(0) + F(1) = 0 + 1 = 1 F(3) = F(1) + F(2) = 1 + 1 = 2 F(4) = F(2) + F(3) = 1 + 2 = 3 F(5) = F(3) + F(4) =
programmers.co.kr
def solution(n):
fibo = [0, 1, 1]
for i in range(3, n + 1):
fibo.append( ( fibo[i-1] + fibo[i-2] ) % 1234567 )
return fibo[-1]
์ด๋ ต์ง๋ง, ๋์์ ๋๋ค!
#include <string>
#include <vector>
using namespace std;
int solution(int n) {
vector<int> fibo = {0, 1, 1};
for(int i=3; i<=n; i++ )
fibo.push_back( ( fibo[i-1] + fibo[i-2] ) % 1234567 );
return fibo.back();
}
728x90