실버1 / 60분 / X #322
Open
실버1 / 60분 / X #322
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Stendhalsynd
force-pushed
the
main
branch
2 times, most recently
from
53fe4e9 to
c3e5389
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
⭐️ 문제에서 주로 사용한 알고리즘
그리디 알고리
대략적인 코드 설명
오른쪽 아래부터 순회하며 동전이 뒤집어지지 않은곳을 찾아 뒤집는다.
코드리뷰시 요청사항
코드를 살펴보면 결과값이 [[0.0], [0,0]]이 되는데 [[1,1],[1,1]]이 되어야하는것 아닌가요..?
35번째 줄에 if arr[i][j] == 0: 로 했다가
if arr[i][j]: 로 변경했는데..