From b7ac10c8c676ac66f0b783340d97a7ac99bbf0b7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EA=B9=80=ED=9D=AC=EC=86=8C?= <h2s0_@naver.com>
Date: Thu, 15 Oct 2026 22:41:38 +0900
Subject: [PATCH] 2239

---
 .../\352\271\200\355\235\254\354\206\214/2239.js" | 15 +++++++++++++++
 1 file changed, 15 insertions(+)
 create mode 100644 "leetcode3/\352\271\200\355\235\254\354\206\214/2239.js"

diff --git "a/leetcode3/\352\271\200\355\235\254\354\206\214/2239.js" "b/leetcode3/\352\271\200\355\235\254\354\206\214/2239.js"
new file mode 100644
index 00000000..215a423d
--- /dev/null
+++ "b/leetcode3/\352\271\200\355\235\254\354\206\214/2239.js"
@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+
+// 사이즈가 n인 nums 배열을 받을 때 nums 배열 안에서 0과 가장 가까운 값을 반환한다. 답이 여러개라면, 큰 값을 반환한다.
+
+var findClosestNumber = function(nums) {
+    let closets = nums[0];
+    for (let i =0; i<nums.length; i++) {
+        if (Math.abs(i) < Math.abs(nums[0]){
+            
+        }
+    }
+};
\ No newline at end of file