Leetcode 242. Valid Anagram

来源:互联网 发布:pubmed数据库手机版 编辑:程序博客网 时间:2024/06/03 16:17

Given two strings s and t, write a function to determine ift is an anagram ofs.

For example,
s = "anagram", t = "nagaram", return true.
s = "rat", t = "car", return false.

public class Solution {    public boolean isAnagram(String s, String t) {if(s == null && t == null){    return true;}if((s==null || t == null)){    return false;}if(s.length() != t.length()){    return false;}char[] str = s.toCharArray();char[] str2 = t.toCharArray();Arrays.sort(str);Arrays.sort(str2);return Arrays.equals(str,str2);    }}


0 0
原创粉丝点击