-
Notifications
You must be signed in to change notification settings - Fork 0
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
09_백트랙킹 #20
base: main
Are you sure you want to change the base?
The head ref may contain hidden characters: "09_\uBC31\uD2B8\uB799\uD0B9"
09_백트랙킹 #20
Conversation
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.
[백트래킹 (필수) 코드 리뷰 완료]
14888, 15665 코드 리뷰 완료.
재원님 안녕하세요!
코드 리뷰가 늦어져서 죄송합니다ㅜㅜ
제출하신 코드 잘봤습니다!!
꼼꼼하게 너무 잘 구현해주셨어요
약간의 피드백을 드렸으니 확인해보시구,
궁금한 점이 있으면 리뷰어를 호출해주세요!
고생하셨습니다🤍
09_백트랙킹/필수/14888.cpp
Outdated
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.
조건에 맞게 매우 잘 구현하셨습니다!!🙌🏻
case 3:{ | ||
getResult(result/operand[idx], idx+1); | ||
break; | ||
} |
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.
한 가지 피드백을 드린다면,
변하지 않는 값을 상수값으로 정의해서 사용해보세용!
const int ADD = 0, SUB = 1, MUL = 2, DIV = 3;
// 생략...
switch(i) {
case ADD:{
// 더하기 로직
}
}
09_백트랙킹/필수/15665.cpp
Outdated
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.
결과를 중복을 피해 s에 저장해서 한번에 출력하는 부분 좋았습니다!👍🏻
구현 잘하셨습니당😊
v.push_back(arr[i]); | ||
s.insert(v); | ||
v.clear(); | ||
}else { |
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.
이럴때 else를 쓰기보다,
if (k==M) 만족 시 return 하는 방식을 사용해보세용!
코드를 더 깔끔하게 만들 수 있습니당
학번: 2276107
이름: 문재원
과제
기존제출: 14888, 15665
추가제출: 2477