-
-
Notifications
You must be signed in to change notification settings - Fork 195
[HISEHOONAN] WEEK 02 solutions #1236
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
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.
주석이 달려있어서 언어가 달라도 이해하기 편했습니다!
남은 문제도 화이팅입니다~~
오늘 시간이없어서 우선 approve하고 추후 리뷰 추가로 진행하겠습니다!!
|
||
class Solution { //다이나믹 프로그래밍. | ||
func climbStairs(_ n: Int) -> Int { | ||
if n < 4 {return n} // 0부터 4보다 작을때 까지는 걍 그 숫자 리턴 |
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.
전과 전전만 있으면 될것같아서 n < 3 조건으로 해도 가능할것같아요!
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.
앗 그렇네요 ! 감사합니다 !
valid-anagram/HISEHOONAN.swift
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.
sort를 해서 간편하게 비교할 수 있어서 좋았습니다!!
제가 swift를 몰라서 궁금한점은 자바스크립트에서는 sort를 하면 시간복잡도가 O(n log n)
인데 swift에서는 어떤가요?
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.
아 ! 제가 알기로도 �Swift에서도 시간복잡도가 O(n log n)으로 알고있습니다 ! introsort라는 알고리즘으로 작동합니다 !
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!