Leetcode242ValidAnagram

最新推荐文章于 2025-05-09 00:08:34 发布

Winter_ann

最新推荐文章于 2025-05-09 00:08:34 发布

阅读量199

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/Winter_ann/article/details/50458648

本文提供了一个函数，用于确定给定的两个字符串是否为字谜。通过将字符串转换为字符数组并排序，然后比较排序后的数组来实现这一功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

 import java.util.Arrays;
public class Solution {
    public boolean isAnagram(String s, String t) {
	 char [] stringArrs = s.toCharArray(); 
	 char [] stringArrt = t.toCharArray();
	 Arrays.sort(stringArrs);
	 Arrays.sort(stringArrt);
     return Arrays.equals(stringArrs, stringArrt);
    }
    public static void main(String args[]){
        Solution va = new Solution();
        String a = "asdfhg";
        String b = "asdfgh";
        va.isAnagram(a,b);
        System.out.println(va.isAnagram(a,b));
        String c = "asdfhg";
        String d = "asdfhdfg";
        va.isAnagram(c,d);
        System.out.println(va.isAnagram(c,d));
    }
}