Skip to content

Conversation

@muncool39
Copy link
Member

@muncool39 muncool39 commented Jan 27, 2026

🔥 해결한 문제

백준

프로그래머스


💡 새롭게 알게된 점


🚀 보완할 점

@muncool39 muncool39 changed the title Mun Mun: 1월 4주차 문제 풀이 Jan 27, 2026
@muncool39 muncool39 requested a review from gitseoyeon January 27, 2026 06:42
@muncool39 muncool39 self-assigned this Jan 27, 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.

해결하기 어려운 문제였던거같은데 덕분에 풀이법 배워갑니다!

Comment on lines +30 to +38
private int getStart(int[] a1, int[] a2, int n) {
for(int i=n-1;i>=0;i--) {
if(a1[i] > 0 || a2[i] > 0) {
return i;
}
}
return -1;
}

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 January 29, 2026 03:59
@muncool39 muncool39 merged commit 9ad07ab into upload Jan 29, 2026
@muncool39 muncool39 deleted the mun branch January 29, 2026 03:59
muncool39 added a commit that referenced this pull request Jan 29, 2026
* Mun: 1월 4주차 문제 풀이 (#10)

* solve: 배

* solve: 음하철도 구구팔

* solve: 좋은 구간

* solve: 택배 배달과 수거하기

* Min: 1월 4주차 문제풀이 (#11)

* 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.

3 participants