GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/strings/CheckAnagrams.java at master · loisoft/Java Expand file tree/ Copy pathCheckAnagrams.javaMore file actions 32 lines (29 loc) · 902 Bytes / Copy pathCheckAnagrams.javaFile metadata and controls32 lines (29 loc) · 902 Bytes 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 package strings; import java.util.Arrays; /** * Two strings are anagrams if they are made of the same letters arranged differently (ignoring the * case). */ public class CheckAnagrams { public static void main(String[] args) { assert isAnagrams("Silent", "Listen"); assert isAnagrams("This is a string", "Is this a string"); assert !isAnagrams("There", "Their"); } /** * Check if two strings are anagrams or not * * @param s1 the first string * @param s2 the second string * @return {@code true} if two string are anagrams, otherwise {@code false} */ public static boolean isAnagrams(String s1, String s2) { s1 = s1.toLowerCase(); s2 = s2.toLowerCase(); char[] values1 = s1.toCharArray(); char[] values2 = s2.toCharArray(); Arrays.sort(values1); Arrays.sort(values2); return new String(values1).equals(new String(values2)); } } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |