242. Valid Anagram

标签：The   div   example   and   har   style   value   output   val   

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?

class Solution {
    public boolean isAnagram(String s, String t) {
        char[] c1 = s.toCharArray();
        char[] c2 = t.toCharArray();
        Arrays.sort(c1);
        Arrays.sort(c2);
        return String.valueOf(c1).equals(String.valueOf(c2));
    }
}

妈的，轻松加愉快

242. Valid Anagram

标签：The   div   example   and   har   style   value   output   val   

原文地址：https://www.cnblogs.com/wentiliangkaihua/p/11403476.html