Skip to content

[DAEUN9] WEEK 01 solutions #1182

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 1 commit into from
Apr 5, 2025
Merged

[DAEUN9] WEEK 01 solutions #1182

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
15 changes: 15 additions & 0 deletions two-sum/DAEUN9.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
import java.util.*;

class Solution {
public int[] twoSum(int[] nums, int target) {
Map<Integer, Integer> existedMap = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
int remain = target - nums[i];
if (existedMap.containsKey(remain)) {
return new int[]{existedMap.get(remain), i};
}
existedMap.put(nums[i], i);
}
return new int[]{0, 0};
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Constraints: Only one valid answer exists 로 인해 항상 정답이 존재하므로 return new int[]{0, 0};는 불필요한 코드로 보입니다. 필요할 경우, 예외 처리를 추가하는 것이 더 적절할 것 같습니다.

}
}