[LeetCode]Top Interview Questions/Easy Collection/Valid Anagram
程序员文章站
2022-07-14 14:37:10
...
Valid Anagram
Given two strings s and t , write a function to determine if t is an anagram of s.
Example 1:
Input: s = “anagram”, t = “nagaram”
Output: true
Example 2:
Input: s = “rat”, t = “car”
Output: false
Note:
You may assume the string contains only lowercase alphabets.
Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?
Solution
class Solution {
public boolean isAnagram(String s, String t) {
if(s.length() != t.length()){
return false;
}else{
char[] schars = s.toCharArray();
char[] tchars = t.toCharArray();
Arrays.sort(schars);
Arrays.sort(tchars);
for(int i = 0,j = 0 ; i < schars.length ; i++,j++){
if(schars[i] != tchars[j]){
return false;
}
}
return true;
}
}
}
上一篇: 给服务器添加新用户
下一篇: 19. 删除链表的倒数第N个节点