Algorithm문제풀이: LeetCode의 “242. Valid Anagram”
🧑🚀문제링크: https://leetcode.com/problems/valid-anagram/
Given two strings s and t, return true if t is an anagram of s, and false otherwise.
An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
Example 1:
Input: s = "anagram", t = "nagaram"
Output: true
Example 2:
Input: s = "rat", t = "car"
Output: false
Constraints:
1 <= s.length, t.length <= 5 * 104
s and t consist of lowercase English letters.
Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?
여러분은 어떻게 해결하셨나요? 솔루션을 댓글로 달아주세요~~!
콘텐츠를 더 읽고 싶다면?
원티드에 가입해 주세요. 로그인 후 모든 글을 볼 수 있습니다.
・댓글 1
(미사용 회원)2022.07.26
class Solution {
public boolean isAnagram(String s, String t) {
if (s.length() != t.length()) return false;
char[] StringtoCharS = s.toCharArray();
char[] StringtoCharT = t.toCharArray();
Arrays.sort(StringtoCharS);
Arrays.sort(StringtoCharT);
for(int i = 0; i<StringtoCharS.length; i++){
if(StringtoCharS[i] != StringtoCharT[i]){
return false;
}
}
return true;
}
}
for문은
return Arrays.equals(StringtoCharS,StringtoCharT);
로 대체 가능
