Skip to content

[inorrni] WEEK 02 solutions #1265

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

Merged
merged 1 commit into from
Apr 13, 2025
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 21 additions & 0 deletions valid-anagram/inorrni.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
class Solution {
public boolean isAnagram(String s, String t) {
// 속도: 443ms

// 길이가 같을 때 탐색 시작, 다르면 false
if(s.length() == t.length()) {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

먼저 길이를 비교하는 것도 좋은 방법인것 같습니다!
좋은 아이디어 감사합니다 :)

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

감사합니다~~~

List<String> sList = new ArrayList<>(Arrays.asList(s.split("")));

// t 각 문자에 대해 sList에서 제거 시도
for (String ch : t.split("")) {
// remove(ch)는 해당 ch가 있으면 제거하고 true를 반환, 없으면 false를 반환
if (!sList.remove(ch)) {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

s, t를 모두 array로 만든 후, t를 for문돌려 문자 하나하나를 비교하며 제거하는 방식도 참신한것같아요!

return false;
}
}
return true;
}
return false;
}
}