From 1ea8c1686f4d67bb116a57a709f4d2675bab61cf Mon Sep 17 00:00:00 2001
From: SinnoLn <ok373737@naver.com>
Date: Tue, 20 Oct 2026 22:35:54 +0900
Subject: [PATCH] 4078. Three Fibonacci Sum

---
 .../4078. Three Fibonacci Sum.java"           | 31 +++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 "leetcode3/\354\235\264\354\247\204\355\235\254/4078. Three Fibonacci Sum.java"

diff --git "a/leetcode3/\354\235\264\354\247\204\355\235\254/4078. Three Fibonacci Sum.java" "b/leetcode3/\354\235\264\354\247\204\355\235\254/4078. Three Fibonacci Sum.java"
new file mode 100644
index 00000000..632e0ad5
--- /dev/null
+++ "b/leetcode3/\354\235\264\354\247\204\355\235\254/4078. Three Fibonacci Sum.java"	
@@ -0,0 +1,31 @@
+/* 
+
+1. 아이디어 : 피보나치 배열을 실제로 구해서 계산
+
+2. 시간복잡도 : O(250쯤..) - 10억
+
+3. 자료구조/알고리즘 : 배열, 누적합
+
+ */
+
+class Solution {
+    public boolean threeFibonacciSum(int n) {
+        // 10억
+        // 연속된 3개의 원소 합
+
+        int[] dp = new int[250];
+
+        dp[0] = 0;
+        dp[1] = 1;
+        dp[2] = 1;
+
+        for(int i=2; i<250; i++) {
+            dp[i] = dp[i-1] + dp[i-2];
+            
+            int sum = dp[i] + dp[i-1] + dp[i-2];
+            if(sum > n) break;
+            if(sum == n) return true;
+        }
+        return false;
+    }
+}
\ No newline at end of file