Valid Anagram

Title: Valid Anagram Source: leetcode.com

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.

Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?

Java solution

/* https://leetcode.com/problems/valid-anagram/ */
public class ValidAnagram
{
    public boolean isAnagram(String s, String t)
    {
        int[] array = new int[256];
        if(s==null || t==null)
            return false;
        if(s.length()!=t.length())
            return false;
        for(int i=0;i<s.length();i++)
        {
            array[s.charAt(i)]++;
            array[t.charAt(i)]--;
        }
        for(int i=0;i<array.length;i++)
        {
            if(array[i]!=0)
                return false;
        }
        return true;
    }

    public static void main(String args[])
    {
        ValidAnagram v = new ValidAnagram();
        String s = "rat";
        String t = "car";

        System.out.println(v.isAnagram(s,t));
    }
}

/* https://leetcode.com/problems/valid-anagram/ */

public class ValidAnagram

{

public boolean isAnagram(String s, String t)

{

int[] array = new int[256];

if(s==null || t==null)

return false;

if(s.length()!=t.length())

return false;

for(int i=0;i<s.length();i++)

{

array[s.charAt(i)]++;

array[t.charAt(i)]--;

}

for(int i=0;i<array.length;i++)

{

if(array[i]!=0)

return false;

}

return true;

}

public static void main(String args[])

{

ValidAnagram v = new ValidAnagram();

String s = "rat";

String t = "car";

System.out.println(v.isAnagram(s,t));

}

Rate this post

Coddicted

Valid Anagram

Java solution

Leave a Reply Cancel Reply