-
Notifications
You must be signed in to change notification settings - Fork 0
Mun: 1월 4주차 문제 풀이 #10
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
Conversation
gitseoyeon
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
이번주차도 고생하셨습니다! 깔끔한 문제풀이 잘봤어용!!
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
해결하기 어려운 문제였던거같은데 덕분에 풀이법 배워갑니다!
| 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; | ||
| } | ||
|
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
시작 구간을 처음부터 정해놓고 시작해서 확실히 불필요한 부분은 연산이 안들어가니까 좋은거같아요!!
🔥 해결한 문제
백준
프로그래머스
💡 새롭게 알게된 점
🚀 보완할 점