Skip to content

Mun: 2월 1주차 문제 풀이#13

Merged
muncool39 merged 4 commits intouploadfrom
mun
Feb 5, 2026
Merged

Mun: 2월 1주차 문제 풀이#13
muncool39 merged 4 commits intouploadfrom
mun

Conversation

@muncool39
Copy link
Member

🔥 해결한 문제

백준

프로그래머스


🚀 보완할 점

메모리 효율을 생각하며 설계할 수 있도록 노력해야 할 것 같습니다.

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

@gitseoyeon gitseoyeon left a comment

Choose a reason for hiding this comment

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

이번주차도 고생하셨습니다! 좋은 풀이 참고 잘했습니다 ㅎㅎ

Copy link
Member

Choose a reason for hiding this comment

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

객체 생성해서 문제 해결하신게 인상 깊었습니다!! 저도 추후 문제 풀때 객체를 활용해보는걸 도전해보겠습니다 😊

int dr = Integer.parseInt(input[1]);
int[] change = new int[4];
change[cr] = dr;
Queue<Integer> que = new LinkedList<>();
Copy link
Member

Choose a reason for hiding this comment

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

Queue 자료구조를 이용한 새로운 접근 방식을 배워갑니다!

@muncool39 muncool39 changed the base branch from main to upload February 5, 2026 11:51
@muncool39 muncool39 merged commit 1b3c621 into upload Feb 5, 2026
@muncool39 muncool39 deleted the mun 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