[Leetcode] 242. Valid Anagram Java

Topic:

Given, Strings s and T, write a function to determine if it is a anagram of s.

For example,
s = "Anagram", t = "Nagaram", return true.
s = "Rat", t = "Car", return false.

test instructions and analysis: requires determining whether two strings are composed of the same characters. Here are two methods, (1) count the number of occurrences of each different character in the string, and then determine (2) sort the strings in the same order, and then determine whether the characters for each position of the two string are equal.

Code Listing 1:

public class Solution {public    Boolean Isanagram (string s, String t) {        if (t.length ()!=s.length ()) return false;in T[] Count=new int[26];  Because they are all lowercase letters, a maximum of 26 characters for (int i=0;i<s.length (); i++) {Count[s.charat (i)-' a ']++;count[t.charat (i)-' a ']--;} for (int i=0;i<count.length;i++) {if (count[i]!=0) return false;} return true;    }}

Code Listing 2:

public class Solution {public    Boolean Isanagram (string s, String t) {        if (t.length ()!=s.length ()) return false;
   char[] S1=s.tochararray ();        Char[] T1=t.tochararray (); Arrays.sort (S1); Arrays.sort (t1); for (int i=0;i<s.length (); i++) {if (S1[i]!=t1[i]) return false;} return true;    }}

　　

[Leetcode] 242. Valid Anagram Java