-
Notifications
You must be signed in to change notification settings - Fork 99
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
2022.04.18(월) jaewon1676 7문제의 풀이 추가 #34
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.
좋은 풀이 잘 보았습니다! 기존에 없던 문제도 계속 추가되고, 레벨 3도 풀어주고 계시군요! 날짜를 헷갈려서 오늘 체크를 했네요 🥲 고생많으셨습니다!! 😄
// https://programmers.co.kr/learn/courses/30/lessons/12977?language=javascript |
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.
문제 링크 추가해주셨네요! 감사합니다 👍 👍
(answer[i] >= 1 ? cnt += 1 : null) | ||
} | ||
return cnt |
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.
return answer[i].filter(x=>x >=1).length
를 사용해보셔도 좋을 것 같아요!
|
||
// s.split(' ') // 띄어쓰기를 기준으로 나눕니다. | ||
// .map(el => el.split('')) 나눈 덩어리를 다시 요소 하나 하나씩 나눠줍니다 | ||
// .map((el, index) => index == 0 ? el.toUpperCase() : el.toLowerCase()) | ||
// 덩어리의 요소가 첫번째이면 대문자, 그렇지 않으면 소문자로 변환 해줍니다. | ||
// .join('') 작은 배열들을 합쳐줍니다. | ||
// .join(' ') 큰 배열들을 합쳐줍니다. |
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.
상세한 설명 감사합니다 👍 👍
파일 생성 후 추가 2문제 - n^2 배열 자르기 , 단속카메라
기존문제에 5문제 풀이 추가하였습니다 각각 커밋 하였습니다 😄