Skip to content

[JEONGBEOMKO] WEEK 01 solutions #1697

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Jul 27, 2025
Merged

[JEONGBEOMKO] WEEK 01 solutions #1697

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
dda994d
WEEK 01 solutions
JEONGBEOMKO Jul 22, 2025
0fefe2c
feat: two sum
JEONGBEOMKO Jul 22, 2025
68e6c13
feat: contains duplicate
JEONGBEOMKO Jul 26, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions contains-duplicate/jeongbeomko.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,9 @@
import java.util.HashSet;

/*
* 시간복잡도: O(n)
* 공간복잡도: O(n)
* */
class Solution {
public boolean containsDuplicate(int[] nums) {
HashSet<Integer> numSet = new HashSet<>();
Expand Down
6 changes: 5 additions & 1 deletion two-sum/JEONGBEOMKO.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,9 @@
import java.util.HashMap;
import java.util.Map;
/*
시간복잡도: O(n)
공간복잡도: O(n)
*/

class Solution {
public int[] twoSum(int[] nums, int target) {
Expand All @@ -10,7 +14,7 @@ public int[] twoSum(int[] nums, int target) {

for(int i=0; i<nums.length; i++) {
int operand = target - nums[i];
if (numberMap.containsKey(operand) && numberMap.get(operand) != i) { // 자기 자신은 제외
if (numberMap.containsKey(operand) && numberMap.get(operand) != i) {
return new int[] { numberMap.get(target - nums[i]), i };
}
}
Expand Down