Skip to content

Min: 2월 1주차 문제 풀이#14

Merged
muncool39 merged 3 commits intouploadfrom
min
Feb 5, 2026
Merged

Min: 2월 1주차 문제 풀이#14
muncool39 merged 3 commits intouploadfrom
min

Conversation

@gitseoyeon
Copy link
Member

🔥 해결한 문제

백준

프로그래머스


🚒 해결하지 못한 문제

원인 분석

  • 문제 해결 시간을 더 갖고 풀어보겠습니다

개선 계획


💡 새롭게 알게된 점


🚀 보완할 점

@gitseoyeon gitseoyeon requested a review from muncool39 February 3, 2026 10:41
@gitseoyeon gitseoyeon self-assigned this Feb 3, 2026
Copy link
Member

@muncool39 muncool39 left a comment

Choose a reason for hiding this comment

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

이번 스터디도 수고하셨습니다! 아프신 와중에 고생하셨어요 😭
시험도 화이팅입니다!!

if(idx == 0) return;
if(!wheels[idx][6].equals(wheels[idx - 1][2])) {
rotate[idx - 1] = -dir;
changeLeft(idx - 1, -dir);
Copy link
Member

Choose a reason for hiding this comment

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

이렇게 변수 앞에 - 만 붙여도 변환이 가능했네요! 배워갑니다! 👍

if(wheels[i][0].equals("1")) {
sum += plus;
}
plus *= 2;
Copy link
Member

Choose a reason for hiding this comment

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

이렇게 점수 규칙을 파악해서 배열 생성 없이도 잘 계산할 수 있었네요! 👍

@muncool39 muncool39 changed the base branch from main to upload February 5, 2026 11:51
@muncool39 muncool39 merged commit 88503dc into upload Feb 5, 2026
@muncool39 muncool39 deleted the min branch February 5, 2026 11:53
muncool39 added a commit that referenced this pull request Feb 5, 2026
* Mun: 2월 1주차 문제 풀이 (#13)

* solve: 아시아 정보올림피아드

* solve: 올바른 배열

* solve: 톱니바퀴

* solve: 충돌위험찾기

* Min: 2월 1주차 문제 풀이 (#14)

* solve: 아시아 정보올림피아드

* solve: 올바른 배열

* solve: 톱니바퀴

---------

Co-authored-by: SeoYeon Min <126096318+gitseoyeon@users.noreply.github.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants