πŸ“šκ³΅λΆ€/μ½”λ”©ν…ŒμŠ€νŠΈ

ν”„λ‘œκ·Έλž˜λ¨ΈμŠ€ - ν”Όλ³΄λ‚˜μΉ˜ 수, 파이썬 & 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