From 19f620541d62578274a19553a3fea918ce808374 Mon Sep 17 00:00:00 2001 From: hancrysta1 Date: Sat, 14 Dec 2024 11:05:29 +0900 Subject: [PATCH 1/9] contains-duplicate solution --- contains-duplicate/sj.java | 8 ++++++++ 1 file changed, 8 insertions(+) create mode 100644 contains-duplicate/sj.java diff --git a/contains-duplicate/sj.java b/contains-duplicate/sj.java new file mode 100644 index 000000000..b0838e3f0 --- /dev/null +++ b/contains-duplicate/sj.java @@ -0,0 +1,8 @@ +import java.util.*; +class Solution { + public boolean containsDuplicate(int[] nums) { + Set numSet = Arrays.stream(nums).boxed().collect(Collectors.toSet()); + if(numSet.size()!=nums.length) return true; + else return false; + } +} \ No newline at end of file From 4bf599c0c3bbd1e11773c4221051c11c5923b275 Mon Sep 17 00:00:00 2001 From: hancrysta1 Date: Sat, 14 Dec 2024 11:27:27 +0900 Subject: [PATCH 2/9] valid-palindrome solution --- valid-palindrome/sj.java | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 valid-palindrome/sj.java diff --git a/valid-palindrome/sj.java b/valid-palindrome/sj.java new file mode 100644 index 000000000..96012eab1 --- /dev/null +++ b/valid-palindrome/sj.java @@ -0,0 +1,18 @@ +import java.util.*; +class Solution { + public boolean isPalindrome(String s) { + String words = s.toLowerCase().replaceAll("[^0-9A-Za-z]",""); + //System.out.println(words); + Deque stack = new ArrayDeque<>(); + for(int i=0;i Date: Sat, 14 Dec 2024 11:28:33 +0900 Subject: [PATCH 3/9] top-k-frequent-elements solution --- top-k-frequent-elements/sj.java | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 top-k-frequent-elements/sj.java diff --git a/top-k-frequent-elements/sj.java b/top-k-frequent-elements/sj.java new file mode 100644 index 000000000..0fba33de1 --- /dev/null +++ b/top-k-frequent-elements/sj.java @@ -0,0 +1,17 @@ +import java.util.*; +class Solution { + public int[] topKFrequent(int[] nums, int k) { + Map count = new HashMap<>(); + for(int i=0;i sortedCount = new ArrayList<>(count.keySet()); + sortedCount.sort((a,b)->count.get(b)-count.get(a));//value 기준 키 정렬 + int[] answer = new int[k]; + for(int i=0;i Date: Wed, 18 Dec 2024 13:24:14 +0900 Subject: [PATCH 4/9] Update sj.java --- top-k-frequent-elements/sj.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/top-k-frequent-elements/sj.java b/top-k-frequent-elements/sj.java index 0fba33de1..dab94ffa5 100644 --- a/top-k-frequent-elements/sj.java +++ b/top-k-frequent-elements/sj.java @@ -14,4 +14,4 @@ public int[] topKFrequent(int[] nums, int k) { return answer; } -} \ No newline at end of file +} From ba795a0c1367918f87e1e690479c9d5c90ae6daa Mon Sep 17 00:00:00 2001 From: SooJeong Han <105469888+hancrysta1@users.noreply.github.com> Date: Wed, 18 Dec 2024 13:24:56 +0900 Subject: [PATCH 5/9] Update sj.java --- contains-duplicate/sj.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/contains-duplicate/sj.java b/contains-duplicate/sj.java index b0838e3f0..9a9e3cfc6 100644 --- a/contains-duplicate/sj.java +++ b/contains-duplicate/sj.java @@ -5,4 +5,4 @@ public boolean containsDuplicate(int[] nums) { if(numSet.size()!=nums.length) return true; else return false; } -} \ No newline at end of file +} From 8471fa09380a9678f412159840d8896b3bad15b4 Mon Sep 17 00:00:00 2001 From: SooJeong Han <105469888+hancrysta1@users.noreply.github.com> Date: Wed, 18 Dec 2024 13:25:07 +0900 Subject: [PATCH 6/9] Update sj.java --- valid-palindrome/sj.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/valid-palindrome/sj.java b/valid-palindrome/sj.java index 96012eab1..627b4aa76 100644 --- a/valid-palindrome/sj.java +++ b/valid-palindrome/sj.java @@ -15,4 +15,4 @@ public boolean isPalindrome(String s) { } return true; } -} \ No newline at end of file +} From dedce64983deffa663d60532aadb38377eb6b888 Mon Sep 17 00:00:00 2001 From: SooJeong Han <105469888+hancrysta1@users.noreply.github.com> Date: Wed, 18 Dec 2024 13:28:12 +0900 Subject: [PATCH 7/9] Rename sj.java to hancrysta1.java --- top-k-frequent-elements/{sj.java => hancrysta1.java} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename top-k-frequent-elements/{sj.java => hancrysta1.java} (100%) diff --git a/top-k-frequent-elements/sj.java b/top-k-frequent-elements/hancrysta1.java similarity index 100% rename from top-k-frequent-elements/sj.java rename to top-k-frequent-elements/hancrysta1.java From 86f27dcc885ec48c4a17dba11d94a0292825ecd9 Mon Sep 17 00:00:00 2001 From: SooJeong Han <105469888+hancrysta1@users.noreply.github.com> Date: Wed, 18 Dec 2024 13:28:31 +0900 Subject: [PATCH 8/9] Rename sj.java to hancrysta1.java --- contains-duplicate/{sj.java => hancrysta1.java} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename contains-duplicate/{sj.java => hancrysta1.java} (100%) diff --git a/contains-duplicate/sj.java b/contains-duplicate/hancrysta1.java similarity index 100% rename from contains-duplicate/sj.java rename to contains-duplicate/hancrysta1.java From 6f49d2a00231b02453640c3056eb45698f126beb Mon Sep 17 00:00:00 2001 From: SooJeong Han <105469888+hancrysta1@users.noreply.github.com> Date: Wed, 18 Dec 2024 13:29:01 +0900 Subject: [PATCH 9/9] Rename sj.java to hancrysta1.java --- valid-palindrome/{sj.java => hancrysta1.java} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename valid-palindrome/{sj.java => hancrysta1.java} (100%) diff --git a/valid-palindrome/sj.java b/valid-palindrome/hancrysta1.java similarity index 100% rename from valid-palindrome/sj.java rename to valid-palindrome/hancrysta1.java