242. Valid Anagram

最新推荐文章于 2021-02-28 09:05:53 发布

SHURamos

最新推荐文章于 2021-02-28 09:05:53 发布

阅读量258

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/SHURamos/article/details/52586945

版权

Leetcode 专栏收录该内容

220 篇文章 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.

My solution:

import java.util.Arrays;
public class Solution {
    public boolean isAnagram(String s, String t) {
        char[] char_s=s.toCharArray();
        char[] char_t=t.toCharArray();
        Arrays.sort(char_s);
        Arrays.sort(char_t);
        return Arrays.equals(char_s,char_t);
        
    }
}