Skip to content
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.

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

[이지민] - 사과나무, 괄호 회전하기 #274

Merged
merged 2 commits into from
Jun 2, 2024
Merged

Conversation

jeeminimini
Copy link
Member

📌 from issue #271 📌

📋문제 목록📋

사과나무: ✅
괄호 회전하기: ✅ 

@jeeminimini jeeminimini self-assigned this Jun 2, 2024
@jeeminimini jeeminimini requested review from bngsh, jhg3410 and soopeach June 2, 2024 11:40
Comment on lines +7 to +9
tmp = s[0]
s.pop(0)
s.append(tmp)
Copy link
Contributor

Choose a reason for hiding this comment

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

실제로 회전을 시켜주면 항상 0 ~ n-1 인덱스로 탐색하면 되는군요

Comment on lines +14 to +15
share += numbers[i] // 2
rest += numbers[i] % 2
Copy link
Contributor

Choose a reason for hiding this comment

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

저는 if를 추가적으로 붙여줬는데 그냥 이렇게만 해도 되는군요!!

Copy link
Member

@soopeach soopeach left a comment

Choose a reason for hiding this comment

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

고생하셨습니다!

Comment on lines +8 to +9
s.pop(0)
s.append(tmp)
Copy link
Member

Choose a reason for hiding this comment

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

옹... 이렇게 리스트로 만들어서 직접 빼서 넣어주는 방식도 직관적이라 괜찮네요!

isCorrect = False
else:
for i in range(3):
if stack[-1] == start[i]:
Copy link
Member

Choose a reason for hiding this comment

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

파이썬에서 이게 제일 부러워요

Copy link
Member

@jhg3410 jhg3410 left a comment

Choose a reason for hiding this comment

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

굿굿!~ 고생하셨슴다!

@jeeminimini jeeminimini merged commit 76c682a into main Jun 2, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants