Java 一个确定两个字符串是否为anagrams的方法，如果字符串相同，则返回true
一个确定两个字符串是否为anagrams的方法，如果字符串相同，则返回true
实例源码：
源代码：
执行
执行中...
x
1
2
3
//package com.nowjava;4
5
6
public class Main {7
/**来自 8
N o w J a v a . c o m**/9
10
public static void main(String[] argv) throws Exception {11
12
String s1 = "nowjava.com";13
14
String s2 = "nowjava.com";15
16
System.out.println(areAnagrams(s1, s2));17
18
}19
20
21
/**22
23
* A method to determine if two string are anagrams, will return true if the24
25
* strings are the same26
27
* 28
29
* @param s130
31
* @param s232
33
* @return true if the two input words are anagrams and false if otherwise34
35
*/36
37
public static boolean areAnagrams(String s1, String s2) {38
39
// Compare the sorted strings40
41
return sort(s1).equals(sort(s2));/* 来 自 nowjava - 时代Java*/42
43
}44
45
46
/**47
48
* Sorts each character of a string parameter using insertion sort49
50
* 51
52
* @param myString53
54
* @return the sorted version of the input string as a string55
56
*/57
58
public static String sort(String myString) {59
60
61
if (myString.length() == 0) {62
63
return "";64
65
} else {66
67
// Sort should not be case sensitive68
69
myString = myString.toLowerCase();70
71
// Calls the helper method to get an array of chars72
73
char[] myWord = toArray(myString);74
75
76
// Do the insertion sort77
78
for (int i = 1; i < myWord.length; i++) {79
80
int j;81
82
for (j = i - 1; j >= 0 && (myWord[j] >= myString.charAt(i)); j--) {83
84
myWord[j + 1] = myWord[j];85
86
}87
88
myWord[j + 1] = myString.charAt(i);89
90
}91
92
String finalWord = "";93
94
// Read the sorted characters of myWord into finalWord95
96
for (int i = 0; i < myWord.length; i++) {97
98
finalWord += myWord[i];99
100
}101
102
return finalWord;103
104
}105
106
}107
108
109
/**110
111
* A helper method used when sorting a word112
113
* 114
115
* @param myString116
/**代码未完, 请加载全部代码(NowJava.com).**/执行结果：
本文系作者在时代Java发表，未经许可，不得转载。如有侵权，请联系nowjava@qq.com删除。
编辑于
关注时代Java