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
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 |
/* 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)); } } |