12 - Key Sequence Detection #19
Open
Conversation
This file contains 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
?: secretcode 문자열의 자리수 만큼만 비교 push, pop 연산을 위해 List 형 자료 구조 생성 List에 들어가는 자료 수의 제한을 두고 key 입력시 최대 갯수 초과시 자름 join을 이용해 List형 자료를 하나의 문자열로 치환 후 includes메소드 를 이용해 확인
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.
?: secretcode 문자열의 자리수 만큼만 비교
push, pop 연산을 위해 List 형 자료 구조 생성
List에 들어가는 자료 수의 제한을 두고 key 입력시 최대 갯수 초과시
자름
join을 이용해 List형 자료를 하나의 문자열로 치환 후 includes메소드
를 이용해 확인