Skip to content

[jylee2033] WEEK 01 solutions #2361

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

Open
jylee2033 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

[jylee2033] WEEK 01 solutions #2361

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
6 changes: 6 additions & 0 deletions two-sum/jylee2033.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
for i in range(len(nums) - 1):
Copy link
Contributor

@riveroverflows riveroverflows Mar 7, 2026

Choose a reason for hiding this comment

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

python 스타일 관점에서 작은 제안 하나 드립니다.
현재 코드는 nums[i]를 반복해서 접근하는 구조인데, enumerate를 사용하면 조금 더 pythonic하고 읽기 쉬운 코드로 표현할 수 있습니다!

예를 들면 아래와 같은 형태입니다.

for i, a in enumerate(nums):
    for j in range(i + 1, len(nums)):
        if a + nums[j] == target:
            return [i, j]

이렇게 하면 nums[i] 반복 접근을 줄일 수 있고,
a라는 변수로 현재 값을 바로 표현할 수 있어서 코드 의도가 조금 더 명확해집니다.

하지만 지금 코드도 충분히 직관적이고 좋은 코드라고 생각합니다!

for j in range(i + 1, len(nums)):
if nums[i] + nums[j] == target:
return [i, j]