From 5c689c60999c2e57e683007144213c1a4e7241dc Mon Sep 17 00:00:00 2001 From: Hoyoung Jung Date: Mon, 3 Feb 2020 16:47:00 +0900 Subject: [PATCH 1/5] Be2020 (#84) MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit * Update Readme: add commit rule - 규칙내용 추가 * [sql] programmers sql lv.1 가장 최신 날짜 구하기 문제 * Change year to 2020 --- 200203/honux77/59415.sql | 6 ++++++ README.md | 25 ++++++++++++++++++++++++- 2 files changed, 30 insertions(+), 1 deletion(-) create mode 100644 200203/honux77/59415.sql diff --git a/200203/honux77/59415.sql b/200203/honux77/59415.sql new file mode 100644 index 0000000..943d93d --- /dev/null +++ b/200203/honux77/59415.sql @@ -0,0 +1,6 @@ +-- 가장 최근에 동물이 들어온 날짜를 좋아하는 SQL 문 +SELECT DATETIME FROM ANIMAL_INS ORDER BY DATETIME DESC LIMIT 1; + +-- 다른 풀이 +SELECT MAX(DATETIME) FROM ANIMAL_INS; + diff --git a/README.md b/README.md index 4ab9099..28972ad 100644 --- a/README.md +++ b/README.md @@ -1,2 +1,25 @@ # algorithm-practice -2019 코드스쿼드 백엔드 알고리즘 연습 저장소 + +2020 코드스쿼드 백엔드 알고리즘 연습 저장소 + +## 커밋하기 + +- 이 저장소를 포크한다. +- 문제를 풀고 커밋한다. 단 아래의 폴더구조를 따라 문제풀이를 작성한다. + +날짜/GitHubId/문제풀이.확장자 + +예) 20200203/honux77/Runner.java + +- 주석 등을 이용해 문제의 출처를 기입할 것 + +## 푸시 및 풀리퀘 + +- 충돌이 나지 않고 병합이 가능할 것 +- 폴더 구조 규칙을 지킬 것 +- 위 사항을 만족하면 풀리퀘는 리뷰 없이 머지된다. + +## 통계보기 + +- 주기적으로 통계를 통해 자신의 커밋수를 확인하고 열심히 풀어보자 + From c74bfc2bda72e11e69e18d66fef25a7c6a017d3a Mon Sep 17 00:00:00 2001 From: KIM DONG HWAN Date: Mon, 3 Feb 2020 17:29:45 +0900 Subject: [PATCH 2/5] Test Commit --- "200203/Han/\355\205\214\354\212\244\355\212\270.md" | 2 ++ 1 file changed, 2 insertions(+) create mode 100644 "200203/Han/\355\205\214\354\212\244\355\212\270.md" diff --git "a/200203/Han/\355\205\214\354\212\244\355\212\270.md" "b/200203/Han/\355\205\214\354\212\244\355\212\270.md" new file mode 100644 index 0000000..8243beb --- /dev/null +++ "b/200203/Han/\355\205\214\354\212\244\355\212\270.md" @@ -0,0 +1,2 @@ +테스트입니당 + From 71ce751c23eeee8f2c8bb3a44a8f85a509ddf923 Mon Sep 17 00:00:00 2001 From: KIM DONG HWAN Date: Tue, 4 Feb 2020 22:19:07 +0900 Subject: [PATCH 3/5] =?UTF-8?q?TestCommit=20=EC=82=AD=EC=A0=9C,=20?= =?UTF-8?q?=ED=94=84=EB=A1=9C=EA=B7=B8=EB=9E=98=EB=A8=B8=EC=8A=A4=20Top=20?= =?UTF-8?q?=EB=AC=B8=EC=A0=9C=20=ED=95=B4=EA=B2=B0?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../\355\205\214\354\212\244\355\212\270.md" | 2 -- 200204/102092/Top.java | 30 +++++++++++++++++++ 2 files changed, 30 insertions(+), 2 deletions(-) delete mode 100644 "200203/Han/\355\205\214\354\212\244\355\212\270.md" create mode 100644 200204/102092/Top.java diff --git "a/200203/Han/\355\205\214\354\212\244\355\212\270.md" "b/200203/Han/\355\205\214\354\212\244\355\212\270.md" deleted file mode 100644 index 8243beb..0000000 --- "a/200203/Han/\355\205\214\354\212\244\355\212\270.md" +++ /dev/null @@ -1,2 +0,0 @@ -테스트입니당 - diff --git a/200204/102092/Top.java b/200204/102092/Top.java new file mode 100644 index 0000000..ecdbf10 --- /dev/null +++ b/200204/102092/Top.java @@ -0,0 +1,30 @@ +import java.util.Stack; + +/* +https://programmers.co.kr/learn/courses/30/lessons/42588 +*/ + +class Solution { + public int[] solution(int[] heights) { + int[] answer = new int[heights.length]; + Stack stk = new Stack<>(); + int top; + + for (int i = 0; i < heights.length; i++) { + stk.add(heights[i]); + } + + while (!stk.isEmpty()) { + top = stk.pop(); + + for (int j = stk.size(); j >= 0; j--) { + if (heights[j] > top) { + answer[stk.size()] = j + 1; + break; + } + } + } + + return answer; + } +} \ No newline at end of file From fb6834646453ec76ff574dd079338b4b68413c68 Mon Sep 17 00:00:00 2001 From: KIM DONG HWAN Date: Tue, 4 Feb 2020 22:26:56 +0900 Subject: [PATCH 4/5] =?UTF-8?q?Revert=20"TestCommit=20=EC=82=AD=EC=A0=9C,?= =?UTF-8?q?=20=ED=94=84=EB=A1=9C=EA=B7=B8=EB=9E=98=EB=A8=B8=EC=8A=A4=20Top?= =?UTF-8?q?=20=EB=AC=B8=EC=A0=9C=20=ED=95=B4=EA=B2=B0"?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit This reverts commit 71ce751c23eeee8f2c8bb3a44a8f85a509ddf923. --- .../\355\205\214\354\212\244\355\212\270.md" | 2 ++ 200204/102092/Top.java | 30 ------------------- 2 files changed, 2 insertions(+), 30 deletions(-) create mode 100644 "200203/Han/\355\205\214\354\212\244\355\212\270.md" delete mode 100644 200204/102092/Top.java diff --git "a/200203/Han/\355\205\214\354\212\244\355\212\270.md" "b/200203/Han/\355\205\214\354\212\244\355\212\270.md" new file mode 100644 index 0000000..8243beb --- /dev/null +++ "b/200203/Han/\355\205\214\354\212\244\355\212\270.md" @@ -0,0 +1,2 @@ +테스트입니당 + diff --git a/200204/102092/Top.java b/200204/102092/Top.java deleted file mode 100644 index ecdbf10..0000000 --- a/200204/102092/Top.java +++ /dev/null @@ -1,30 +0,0 @@ -import java.util.Stack; - -/* -https://programmers.co.kr/learn/courses/30/lessons/42588 -*/ - -class Solution { - public int[] solution(int[] heights) { - int[] answer = new int[heights.length]; - Stack stk = new Stack<>(); - int top; - - for (int i = 0; i < heights.length; i++) { - stk.add(heights[i]); - } - - while (!stk.isEmpty()) { - top = stk.pop(); - - for (int j = stk.size(); j >= 0; j--) { - if (heights[j] > top) { - answer[stk.size()] = j + 1; - break; - } - } - } - - return answer; - } -} \ No newline at end of file From e23f5682c95fbe6b02a5dedfe31b57a337c10707 Mon Sep 17 00:00:00 2001 From: KIM DONG HWAN Date: Tue, 4 Feb 2020 22:31:04 +0900 Subject: [PATCH 5/5] =?UTF-8?q?=EB=B8=8C=EB=9E=9C=EC=B9=98=20=EC=88=98?= =?UTF-8?q?=EC=A0=95,=20Top=20commit?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../\355\205\214\354\212\244\355\212\270.md" | 2 -- 200204/102092/Top.java | 30 +++++++++++++++++++ 2 files changed, 30 insertions(+), 2 deletions(-) delete mode 100644 "200203/Han/\355\205\214\354\212\244\355\212\270.md" create mode 100644 200204/102092/Top.java diff --git "a/200203/Han/\355\205\214\354\212\244\355\212\270.md" "b/200203/Han/\355\205\214\354\212\244\355\212\270.md" deleted file mode 100644 index 8243beb..0000000 --- "a/200203/Han/\355\205\214\354\212\244\355\212\270.md" +++ /dev/null @@ -1,2 +0,0 @@ -테스트입니당 - diff --git a/200204/102092/Top.java b/200204/102092/Top.java new file mode 100644 index 0000000..a1b7489 --- /dev/null +++ b/200204/102092/Top.java @@ -0,0 +1,30 @@ +import java.util.Stack; + +/* +https://programmers.co.kr/learn/courses/30/lessons/42588 +*/ + +class Solution { + public int[] solution(int[] heights) { + int[] answer = new int[heights.length]; + Stack stk = new Stack(); + int top; + + for (int i = 0; i < heights.length; i++) { + stk.add(heights[i]); + } + + while (!stk.isEmpty()) { + top = stk.pop(); + + for (int j = stk.size(); j >= 0; j--) { + if (heights[j] > top) { + answer[stk.size()] = j + 1; + break; + } + } + } + + return answer; + } +} \ No newline at end of file