From 712bdc87e558bcfd5b19dead62cbe575edd5ad5b Mon Sep 17 00:00:00 2001 From: naryeong-ko Date: Fri, 13 May 2022 22:57:15 +0900 Subject: [PATCH 1/3] =?UTF-8?q?220513=5Fsolve=20:=20=EB=82=B4=EC=A0=81=5Fk?= =?UTF-8?q?o?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../Programmers/Lv1/\353\202\264\354\240\201_ko.java" | 10 +++++++++- 1 file changed, 9 insertions(+), 1 deletion(-) diff --git "a/0517/Programmers/Lv1/\353\202\264\354\240\201_ko.java" "b/0517/Programmers/Lv1/\353\202\264\354\240\201_ko.java" index 8b13789..b093149 100644 --- "a/0517/Programmers/Lv1/\353\202\264\354\240\201_ko.java" +++ "b/0517/Programmers/Lv1/\353\202\264\354\240\201_ko.java" @@ -1 +1,9 @@ - +class Solution { + public int solution(int[] a, int[] b) { + int answer = 0; + int len = a.length; + for (int i = 0; i < len; i++) + answer += a[i] * b[i]; + return answer; + } +} \ No newline at end of file From 90875fbce3f6d3f8d83a34537f304327edaed606 Mon Sep 17 00:00:00 2001 From: naryeong-ko Date: Fri, 13 May 2022 22:57:26 +0900 Subject: [PATCH 2/3] =?UTF-8?q?220513=5Fsolve=20:=20=EB=B0=A9=EB=AC=B8?= =?UTF-8?q?=EA=B8=B8=EC=9D=B4=5Fko?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...3\254\270\352\270\270\354\235\264_ko.java" | 43 +++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git "a/0517/Programmers/Lv2/\353\260\251\353\254\270\352\270\270\354\235\264_ko.java" "b/0517/Programmers/Lv2/\353\260\251\353\254\270\352\270\270\354\235\264_ko.java" index 8b13789..8f7af75 100644 --- "a/0517/Programmers/Lv2/\353\260\251\353\254\270\352\270\270\354\235\264_ko.java" +++ "b/0517/Programmers/Lv2/\353\260\251\353\254\270\352\270\270\354\235\264_ko.java" @@ -1 +1,44 @@ +import java.util.HashMap; +import java.util.Map; +class Solution { + public int solution(String dirs) { + Map map = new HashMap<>(); + int len = dirs.length(); + int[] dx = { -1, 1, 0, 0 }; // 상하우좌 + int[] dy = { 0, 0, 1, -1 }; + int x = 0; // -5~5사용 + int y = 0; + int nx; + int ny; + int mode = 0; + + for (int i = 0; i < len; i++) { + switch (dirs.charAt(i)) { + case 'U': + mode = 0; + break; + case 'D': + mode = 1; + break; + case 'R': + mode = 2; + break; + case 'L': + mode = 3; + break; + } + nx = x + dx[mode]; + ny = y + dy[mode]; + if (nx < -5 || ny < -5 || nx > 5 || ny > 5) // 범위 벗어나면 무시 + continue; + map.put(Integer.toString(nx) + ny + x + y, true); // 양방향 모두 저장 + map.put(Integer.toString(x) + y + nx + ny, true); + x = nx; // 현재 위치 변경 + y = ny; + } + + int answer = map.size() / 2; + return answer; + } +} \ No newline at end of file From 94cf3e941ff43f33101de5381721806f4ccad961 Mon Sep 17 00:00:00 2001 From: naryeong-ko <99406992+naryeong-ko@users.noreply.github.com> Date: Thu, 2 Jun 2022 15:58:34 +0900 Subject: [PATCH 3/3] =?UTF-8?q?Update=20=EB=B0=A9=EB=AC=B8=EA=B8=B8?= =?UTF-8?q?=EC=9D=B4=5Fko.java?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...3\254\270\352\270\270\354\235\264_ko.java" | 27 ++++++++----------- 1 file changed, 11 insertions(+), 16 deletions(-) diff --git "a/0517/Programmers/Lv2/\353\260\251\353\254\270\352\270\270\354\235\264_ko.java" "b/0517/Programmers/Lv2/\353\260\251\353\254\270\352\270\270\354\235\264_ko.java" index 8f7af75..c418a5f 100644 --- "a/0517/Programmers/Lv2/\353\260\251\353\254\270\352\270\270\354\235\264_ko.java" +++ "b/0517/Programmers/Lv2/\353\260\251\353\254\270\352\270\270\354\235\264_ko.java" @@ -1,18 +1,15 @@ -import java.util.HashMap; -import java.util.Map; +import java.util.HashSet; class Solution { - public int solution(String dirs) { - Map map = new HashMap<>(); + public int solution(String dirs) { + HashSet set = new HashSet<>(); int len = dirs.length(); int[] dx = { -1, 1, 0, 0 }; // 상하우좌 int[] dy = { 0, 0, 1, -1 }; int x = 0; // -5~5사용 int y = 0; - int nx; - int ny; + int nx, ny; int mode = 0; - for (int i = 0; i < len; i++) { switch (dirs.charAt(i)) { case 'U': @@ -30,15 +27,13 @@ public int solution(String dirs) { } nx = x + dx[mode]; ny = y + dy[mode]; - if (nx < -5 || ny < -5 || nx > 5 || ny > 5) // 범위 벗어나면 무시 + if (nx < -5 || ny < -5 || nx > 5 || ny > 5) continue; - map.put(Integer.toString(nx) + ny + x + y, true); // 양방향 모두 저장 - map.put(Integer.toString(x) + y + nx + ny, true); - x = nx; // 현재 위치 변경 + set.add(Integer.toString(nx) + ny + x + y); + set.add(Integer.toString(x) + y + nx + ny); + x = nx; y = ny; } - - int answer = map.size() / 2; - return answer; - } -} \ No newline at end of file + return set.size()/2; + } +}