[week 6] 주간 결산_연서 - #20
Open
Yeonseo-Jo wants to merge 10 commits into
Open
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
✨ 이번주 문제 풀이
level 1
level 2
📚 이번주 코테 공부 중 느낀점 / 배운 점
level 1
내적
=> reduce 함수 개념 다시 공부!
: 빈 인자로 사용할 때는 _로 표시하기
시저 암호
=> 아스키코드
=> charCodeAt 메서드 : index에 해당하는 문자의 unicode 값을 반환
=> String.fromCharCode() 메서드 : UTF-16 코드 유닛의 시퀀스로부터 문자열을 생성해 반환
약수의 개수
=> 약수를 제곱근으로 구하기 - 제곱근이 정수이면 약수의 개수가 홀수이다!!
level 2
=> 스프레드 연산자를 사용해서 배열 안의 최댓값과 최솟값을 구한다.
=> Math.min 은 파라미터를 콤마로 구분해서 받기 때문에 스프레드 연산자를 사용할 수 있다. Math.max 도 마찬가지다.