Advertisement
Guest User

Untitled

a guest
Oct 20th, 2016
74
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.82 KB | None | 0 0
  1. //This checks whether the two strings are a boolean
  2. public static boolean isAnagram(String string1, String string2){
  3. StringBuilder builder1 = new StringBuilder();
  4. StringBuilder builder2 = new StringBuilder();
  5. lstring1 = string1.toLowerCase();
  6. lstring2 = string2.toLowerCase();
  7. for (int i = 0; i < string1.length(); i = i + 1){
  8. if (lstring1.charAt(i) >= 'a' && lstring1.charAt(i) <= 'z' || lstring1.charAt(i) >= '0' && lstring1.charAt(i) <= '9')
  9. builder1.append(lstring1.charAt(i));
  10. }
  11. for (int j = 0; j < string2.length(); j = j + 1){
  12. if (lstring2.charAt(j) >= 'a' && lstring2.charAt(j) <= 'z' || lstring2.charAt(j) >= '0' && lstring2.charAt(j) <= '9')
  13. builder2.append(lstring2.charAt(j));
  14. }
  15. if (string1.length() != string2.length())
  16. return false;
  17.  
  18. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement