Skip to content

Conversation

jungmyunggi
Copy link
Collaborator

문제

Type Info
Time Complexity O(logN)
Space Complexity O(1)
Algorithm x
Data Structure stack

Constraints

  • date.length == 10
  • date[4] == date[7] == '-', and all other date[i]'s are digits.
  • The input is generated such that date represents a valid Gregorian calendar date between Jan 1st, 1900 and Dec 31st, 2100 (both inclusive).

Edge Case

  • 없음

풀이

  1. 년-월-일을 "-"를 기준으로 split
  2. 각 숫자를 2진수 변환 함수에 삽입
  3. 2진수 변환시 숫자를 2로 나누고 나머지를 스택에 저장 후 하나씩 읽음

어려웠던 점

  • 2진수 변환을 코드로 만들어보는건 처음이여서 조금 헷갈렸음

알게된 점

  • 없음

@jungmyunggi jungmyunggi self-assigned this Feb 8, 2025
@github-actions github-actions bot enabled auto-merge (squash) February 16, 2025 01:37
@github-actions github-actions bot merged commit c92e811 into main Feb 16, 2025
2 checks passed
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.

1 participant