[jj7779607] Week2 #725
Merged
[jj7779607] Week2 #725
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
TonyKim9401
reviewed
Dec 21, 2024
Comment on lines
+25
to
+26
| while (low < high && nums[low] === nums[low + 1]) low++; | ||
| while (low < high && nums[high] === nums[high - 1]) high--; |
There was a problem hiding this comment.
맞아요 :) 전 문제의 핵심은 정렬, 투 포인터 를 극한의 효율로 사용하기 위한 25,26 라인의 while문인것 같습니다. 전 이 부분을 고려 안해서 자꾸 실패했었네요 ㅎㅎ
TonyKim9401
reviewed
Dec 21, 2024
Comment on lines
+6
to
+11
| // 규칙성 찾기 | ||
| // n = 1 -> 1 (1) | ||
| // n = 2 -> 2 (1+1, 2) | ||
| // n = 3 -> 2 + 1 = 3 (1+1+1, 1+2, 2+1) | ||
| // n = 4 -> 2 + 3 = 5 (1+1+1, 1+1+2, 1+2+1, 2+1+1, 2+2) | ||
| // n = 5 -> 3 + 5 = 8 (1+1+1+1+1, 1+1+1+2, 1+1+2+1, 1+2+1+1, 2+1+1+1, 1+2+2, 2+2+1, 2+1+2) |
There was a problem hiding this comment.
규칙성을 잘 찾으셔서 무리없이 풀으셨을것 같습니다!
이런 식의 규칙성 문제는 대부분 DP를 사용하는것 같아요!
TonyKim9401
reviewed
Dec 21, 2024
Comment on lines
+17
to
+27
| for (let i = 0; i < s.length; i++) { | ||
| countS[s[i]] = (countS[s[i]] || 0) + 1; | ||
| countT[t[i]] = (countT[t[i]] || 0) + 1; | ||
| } | ||
|
|
||
| // 두 객체 동일하면 true, 아니면 false | ||
| for (let char in countS) { | ||
| if (countS[char] !== countT[char]) { | ||
| return false; | ||
| } | ||
| } |
There was a problem hiding this comment.
같은 방법이긴 합니다만 count배열을 하나만 두고 같은 값이 s에 있으면 +, t에 있으면 -를 해주면 결국 해당 값이 0이 될거에요.
이때 두번째 for문에서 배열의 값이 모두 0이면 anagram이 성립하는 식으로 풀이 방법도 있습니다 :)
TonyKim9401
approved these changes
Dec 21, 2024
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.
답안 제출 문제
체크 리스트
In Review로 설정해주세요.