From 74278c0a6d27771f6644d8536ed9325d9e53ffbd Mon Sep 17 00:00:00 2001
From: codeisneverodd <codeisneverodd@gmail.com>
Date: Mon, 21 Mar 2022 09:53:40 +0900
Subject: [PATCH 1/2] Add 1 solution.

---
 ...53\225\205\353\224\260\353\250\271\352\270\260.js" | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 "level-2/\353\225\205\353\224\260\353\250\271\352\270\260.js"

diff --git "a/level-2/\353\225\205\353\224\260\353\250\271\352\270\260.js" "b/level-2/\353\225\205\353\224\260\353\250\271\352\270\260.js"
new file mode 100644
index 0000000..7963838
--- /dev/null
+++ "b/level-2/\353\225\205\353\224\260\353\250\271\352\270\260.js"
@@ -0,0 +1,11 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - codeisneverodd
+function solution(land) {
+    for (let rowIndex = 1; rowIndex < land.length; rowIndex++) {
+        for (let colIndex = 0; colIndex < land[0].length; colIndex++) {
+            land[rowIndex][colIndex] += Math.max(...land[rowIndex - 1].slice(0, colIndex), ...land[rowIndex - 1].slice(colIndex + 1))
+        }
+    }
+    return Math.max(...land[land.length - 1])
+}

From d06603d16a68d5211d8b84057b3ae3e56fbbdafb Mon Sep 17 00:00:00 2001
From: codeisneverodd <codeisneverodd@gmail.com>
Date: Wed, 23 Mar 2022 07:32:42 +0900
Subject: [PATCH 2/2] =?UTF-8?q?[=ED=92=80=EC=9D=B4=20=EC=B6=94=EA=B0=80]?=
 =?UTF-8?q?=2022-03-22,=201=EB=AC=B8=EC=A0=9C,=20=EC=98=88=EC=83=81-?=
 =?UTF-8?q?=EB=8C=80=EC=A7=84=ED=91=9C?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...3\201-\353\214\200\354\247\204\355\221\234.js" | 15 +++++++++++++++
 1 file changed, 15 insertions(+)
 create mode 100644 "level-2/\354\230\210\354\203\201-\353\214\200\354\247\204\355\221\234.js"

diff --git "a/level-2/\354\230\210\354\203\201-\353\214\200\354\247\204\355\221\234.js" "b/level-2/\354\230\210\354\203\201-\353\214\200\354\247\204\355\221\234.js"
new file mode 100644
index 0000000..ebc2acb
--- /dev/null
+++ "b/level-2/\354\230\210\354\203\201-\353\214\200\354\247\204\355\221\234.js"
@@ -0,0 +1,15 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - codeisneverodd
+
+function solution(n, a, b) {
+    let currentRound = 1;
+    const myNextNumber = (num) => Math.floor((num + 1) / 2)//내가 이긴경우 다음으로 가지게 될 번호
+    while (a !== b) { // a의 다음 번호가 b의 다음번호와 같아지면 끝난다.
+        if (myNextNumber(a) === myNextNumber(b)) break
+        a = myNextNumber(a)
+        b = myNextNumber(b)
+        currentRound++
+    }
+    return currentRound
+}