From 5e44eea1d744629472d67685961241a02e04c644 Mon Sep 17 00:00:00 2001
From: jihyup-byun <rimgosu@users.noreply.github.com>
Date: Sun, 1 Nov 2026 23:54:02 +0000
Subject: [PATCH] 4097

---
 ...4097. Minimum Value of Merged Integers.py" | 20 +++++++++++++++++++
 1 file changed, 20 insertions(+)
 create mode 100644 "leetcode3/\353\263\200\354\247\200\355\230\221/v3/4097. Minimum Value of Merged Integers.py"

diff --git "a/leetcode3/\353\263\200\354\247\200\355\230\221/v3/4097. Minimum Value of Merged Integers.py" "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/4097. Minimum Value of Merged Integers.py"
new file mode 100644
index 00000000..b3c0f2e1
--- /dev/null
+++ "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/4097. Minimum Value of Merged Integers.py"	
@@ -0,0 +1,20 @@
+'''
+1. 아이디어 :
+- nums를 앞에서부터 두 개씩 짝지어, 두 수의 자릿수를 그대로 이어붙인 정수를 만든다.
+- 짝지어진 수들 중 최솟값을 반환한다.
+2. 시간복잡도 :
+o(n)
+3. 자료구조/알고리즘 :
+문자열, 완전탐색
+
+'''
+
+class Solution:
+    def minMergedInteger(self, nums: list[int]) -> int:
+        n = len(nums)
+        ans = 10e10
+        for i in range(0,n-1,2):
+            tmp = int(f'{nums[i]}{nums[i+1]}')
+            ans = min(tmp, ans)
+        
+        return ans