242. 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?
Rust Solution
struct Solution;
impl Solution {
fn is_anagram(s: String, t: String) -> bool {
let mut s: Vec<char> = s.chars().collect();
let mut t: Vec<char> = t.chars().collect();
s.sort_unstable();
t.sort_unstable();
s == t
}
}
#[test]
fn test() {
assert_eq!(
Solution::is_anagram("anagram".to_string(), "nagaram".to_string()),
true
);
assert_eq!(
Solution::is_anagram("rat".to_string(), "car".to_string()),
false
);
}
Having problems with this solution? Click here to submit an issue on github.