[Leetcode] Valid Anagram

最新推荐文章于 2022-07-08 15:25:09 发布

quansjtu

最新推荐文章于 2022-07-08 15:25:09 发布

阅读量185

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/quansjtu/article/details/52551457

版权

Leetcode 专栏收录该内容

46 篇文章 0 订阅

订阅专栏

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

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

Note:

You may assume the string contains only lowercase alphabets.

public class Solution {
    public boolean isAnagram(String s, String t) {
        if(s.length()!=t.length()) return false;
        char[] ss=s.toCharArray();
        char[] tt=t.toCharArray();
        Arrays.sort(ss);
        Arrays.sort(tt);
        return String.valueOf(ss).equals(String.valueOf(tt));
    }
}