-
Notifications
You must be signed in to change notification settings - Fork 1
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
[2024-02-23] 최승현 자스로 푼 배열문제 #110
Merged
ChoiWheatley
merged 21 commits into
Jungle-7-Algorithm-study:main
from
ChoiWheatley:leet-1657-1732
Feb 24, 2024
Merged
[2024-02-23] 최승현 자스로 푼 배열문제 #110
ChoiWheatley
merged 21 commits into
Jungle-7-Algorithm-study:main
from
ChoiWheatley:leet-1657-1732
Feb 24, 2024
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
… [sliding window]
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.
leet 1657 determine-if-two-strings-are-close
26개의 크기의 0으로 채워진 배열을 사용하여 알파벳 각각의 카운트를 센다. 문제 조건에 따라 문자 occurrence만 같으면 횟수는 섞여도 상관 없기 때문에 첫번째 if문에서와 같이 써도 된다.
두 히스토그램으로부터 정렬한 결과가 일치한다면, 같은 횟수들로만 이루어져있음을 의미하므로 두번째 if문은 다음과 같이 쓸 수 있다.
leet 1732 find-the-highest-altitude
그냥 미분한 배열을 입력으로 주고 0부터 직접 더해가며 최대값을 찾기만 함 된다.