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] Week4 #833

Merged
merged 6 commits into from
Jan 5, 2025
Merged

[byteho0n] Week4 #833

merged 6 commits into from
Jan 5, 2025

Conversation

ekgns33
Copy link
Contributor

@ekgns33 ekgns33 commented Jan 3, 2025

답안 제출 문제

체크 리스트

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

@ekgns33 ekgns33 self-assigned this Jan 3, 2025
@ekgns33 ekgns33 requested a review from a team as a code owner January 3, 2025 05:46
@ekgns33 ekgns33 requested a review from Jay-Mo-99 January 3, 2025 05:46
@github-actions github-actions bot added the java label Jan 3, 2025
@ekgns33 ekgns33 changed the title [ekgns33] Week4 [byteho0n] Week4 Jan 3, 2025
*/
class Solution {
public int missingNumber(int[] nums) {
int sum = 0;
Copy link
Contributor

Choose a reason for hiding this comment

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

totalSum sum의 차이를 이용하여 nums를 정렬하지 않고 최소한의 시간 복잡도로 누락된 숫자를 구하는 효율적인 구조가 인상깊습니다.

만약 n이 매우 큰 숫자인 경우를 고려한다면, n(n+1)/2 계산에서 오버플로우가 발생할 수 있으니 long 타입으로 안전하게 구현해볼 수도 있습니다.

Copy link
Contributor

@SamTheKorean SamTheKorean left a comment

Choose a reason for hiding this comment

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

고생많으셨습니다!

@SamTheKorean SamTheKorean merged commit 931ace2 into DaleStudy:main Jan 5, 2025
1 check 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