피보나치 수 def solution(n): if n == 0: return 0 elif n == 1: return 1 a, b = 0, 1 for _ in range(2, n + 1): a, b = b, a+b # temp = b # b = temp + a # a = temp return b % 1234567Happy Coding Algorithms in Python/Programmers - ALGO ⭐️ 2024.05.04
숫자의 표현 def solution(n): answer = 0 for i in range(1, n+1): curr_sum = 0 j = i while curr_sum Happy Coding Algorithms in Python/Programmers - ALGO ⭐️ 2024.05.04
JadenCase 문자열 만들기 def solution(s): answer = '' words = s.split(" ") for i, word in enumerate(words): if word and not word.isdigit(): f_letter = word[0].upper() rest_word = word[1:].lower() words[i] = f_letter + rest_word return ' '.join(words)Happy Coding Algorithms in Python/Programmers - ALGO ⭐️ 2024.05.03