Skip to content
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

[byteho0n] - Week 7 #934

Merged
merged 5 commits into from
Jan 25, 2025
Merged

[byteho0n] - Week 7 #934

merged 5 commits into from
Jan 25, 2025

Conversation

ekgns33
Copy link
Contributor

@ekgns33 ekgns33 commented Jan 21, 2025

답안 제출 문제

체크 리스트

  • 우측 메뉴에서 PR을 Projects에 추가해주세요.
  • Projects의 오른쪽 버튼(▼)을 눌러 확장한 뒤, Week를 현재 주차로 설정해주세요.
  • 바로 앞에 PR을 열어주신 분을 코드 검토자로 지정해주세요.
  • 문제를 모두 푸시면 프로젝트에서 StatusIn Review로 설정해주세요.
  • 코드 검토자 1분 이상으로부터 승인을 받으셨다면 PR을 병합해주세요.

@ekgns33 ekgns33 self-assigned this Jan 21, 2025
@ekgns33 ekgns33 requested a review from a team as a code owner January 21, 2025 05:28
@github-actions github-actions bot added the java label Jan 21, 2025
@ekgns33 ekgns33 requested a review from Jeehay28 January 21, 2025 05:28
Copy link
Contributor

@obzva obzva left a comment

Choose a reason for hiding this comment

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

안녕하세요 bytehoOn님, 이번 한 주도 수고하셨습니다 :)
상세한 설명 덕에 초스피드 리뷰가 가능했습니다.. 정말 감사합니다
코멘트를 좀 남겨놓았으니 병합 전에 확인 바랍니다
감사합니다

reverse-linked-list/ekgns33.java Show resolved Hide resolved
dp[i][j] = dp[i-1][j] + dp[i][j-1]

tc : O(mn)
sc : O(mn)
Copy link
Contributor

Choose a reason for hiding this comment

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

공간복잡도를 O(m)까지 낮춰볼 수 있을까요?

Copy link
Contributor Author

Choose a reason for hiding this comment

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

1D 배열로 압축하면 될 것 같네요! 어차피 dp[i-1][j]는 1차원 배열에서 바뀌기 이전값을 의미하니 DP 최적화로 가능할 것 같습니당 :)
파스칼삼각형 문제처럼 설정하면 될 것 같아요. 감사합니다!

Copy link
Contributor

Choose a reason for hiding this comment

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

굿입니다~

@Jeehay28
Copy link
Contributor

한 주간 고생 많으셨습니다! 😊

@ekgns33 ekgns33 merged commit 21f4334 into DaleStudy:main Jan 25, 2025
3 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
Status: Completed
Development

Successfully merging this pull request may close these issues.

3 participants