๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
๐Ÿ“š๊ณต๋ถ€/์ฝ”๋”ฉํ…Œ์ŠคํŠธ

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ํ”ผ๋ณด๋‚˜์น˜ ์ˆ˜, ํŒŒ์ด์ฌ & C++

by Janger 2021. 11. 22.
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
๋ฐ˜์‘ํ˜•