Important alert: (current site time 7/15/2013 3:04:17 PM EDT)
 

VB icon

anagrams

Email
Submitted on: 1/4/2004 5:45:52 AM
By: SouthOfHeaven  
Level: Intermediate
User Rating: By 2 Users
Compatibility: Java (JDK 1.2)
Views: 16962
(About the author)
 
     Method that checks if two strings are anagrams. Two strings are anagrams that contain the same characters in any order. Silent and listen are anagrams.
 
code:
Can't Copy and Paste this?
Click here for a copy-and-paste friendly version of this code!
 
Terms of Agreement:   
By using this code, you agree to the following terms...   
  1. You may use this code in your own programs (and may compile it into a program and distribute it in compiled format for languages that allow it) freely and with no charge.
  2. You MAY NOT redistribute this code (for example to a web site) without written permission from the original author. Failure to do so is a violation of copyright laws.   
  3. You may link to this code from another website, but ONLY if it is not wrapped in a frame. 
  4. You will abide by any additional copyright restrictions which the author may have placed in the code or code's description.
				
//**************************************
// Name: anagrams
// Description:Method that checks if two strings are anagrams. Two strings are anagrams that contain the same characters in any order. Silent and listen are anagrams.
// By: SouthOfHeaven
//
// Inputs:Two strings
//
// Returns:Prints if anagram or not.
//
//This code is copyrighted and has// limited warranties.Please see http://www.Planet-Source-Code.com/vb/scripts/ShowCode.asp?txtCodeId=4025&lngWId=2//for details.//**************************************

public class Anagram
{
public static boolean areAnagrams(String string1,
 String string2)
{
				 String workingCopy1 = removeunwanted(string1);
	 			 String workingCopy2 = removeunwanted(string2);
		workingCopy1 = workingCopy1.toLowerCase();
		workingCopy2 = workingCopy2.toLowerCase();
		workingCopy1 = sort(workingCopy1);
		workingCopy2 = sort(workingCopy2);
return workingCopy1.equals(workingCopy2);
}
protected static String removeunwanted(String string)
{
int i, len = string.length();
 	StringBuffer dest = new StringBuffer(len);
	char c;
	for (i = (len - 1); i >= 0; i--)
		{
			c = string.charAt(i);
		if (Character.isLetterOrDigit(c))
		{
				dest.append(c);
		}
		}
return dest.toString();
}
protected static String sort(String string)
{
		int length = string.length();
	char[] charArray = new char[length];
			string.getChars(0, length, charArray, 0);
		java.util.Arrays.sort(charArray);
	 return new String(charArray);
}
public static void main(String[] args)
{
String string1 = "Silent";
String string2 = "Listen";
System.out.println();
System.out.println("Testing whether the following "
 + "strings are anagrams:");
System.out.println("String 1: " + string1);
System.out.println("String 2: " + string2);
System.out.println();
if (areAnagrams(string1, string2))
{
	System.out.println("They are anagrams!");
}
	else
	{
 	 System.out.println("They are not anagrams!");
	}
System.out.println();
}
}


Other 16 submission(s) by this author

 


Report Bad Submission
Use this form to tell us if this entry should be deleted (i.e contains no code, is a virus, etc.).
This submission should be removed because:

Your Vote

What do you think of this code (in the Intermediate category)?
(The code with your highest vote will win this month's coding contest!)
Excellent  Good  Average  Below Average  Poor (See voting log ...)
 

Other User Comments
4/13/2006 6:25:30 PMken

great
(If this comment was disrespectful, please report it.)

 
1/12/2008 8:00:33 AMMajd

Hi
(If this comment was disrespectful, please report it.)

 

Add Your Feedback
Your feedback will be posted below and an email sent to the author. Please remember that the author was kind enough to share this with you, so any criticisms must be stated politely, or they will be deleted. (For feedback not related to this particular code, please click here instead.)
 

To post feedback, first please login.