京东自营 618 + 国补 iPhone 历史最低价
Java 测试是否通过
测试传入的字符串是否为包含每个字母完全相同的数字的字谜。
实例源码：
源代码：
执行
执行中...
x
1
// from 时 代 J a v a 公 众 号 - N o w J a v a . c o m2
3
public class Anagram {4
5
6
/**7
8
* Tests whether the passed-in strings are anagrams --9
10
* containing the exact same number of each letter.11
12
* Punctuation, case, and order don't matter.13
14
* 15
16
* @return true if the strings are anagrams; otherwise, false17
18
*/19
20
public static boolean areAnagrams(String string1, String string2) {21
22
23
String workingCopy1 = removeJunk(string1);24
25
String workingCopy2 = removeJunk(string2);26
27
28
workingCopy1 = workingCopy1.toLowerCase();29
30
workingCopy2 = workingCopy2.toLowerCase();31
32
33
workingCopy1 = sort(workingCopy1);34
35
workingCopy2 = sort(workingCopy2);36
37
38
return workingCopy1.equals(workingCopy2);39
40
}41
/*42
N o w J a v a . c o m - 时 代 Java 提 供43
*/44
45
46
/**47
48
* Removes punctuation & spaces -- everything except 49
50
* letters from the passed-in string.51
52
* 53
54
* @return a stripped copy of the passed-in string55
56
*/57
58
protected static String removeJunk(String string) {59
60
int i, len = string.length();61
62
StringBuilder dest = new StringBuilder(len);63
64
char c;65
66
67
for (i = (len - 1); i >= 0; i--) {68
69
c = string.charAt(i);70
71
if (Character.isLetter(c)) {72
73
dest.append(c);74
75
}76
77
}78
79
80
return dest.toString();81
82
}83
84
85
/** 86
87
* Sorts the passed-in string. 88
89
* 90
91
* @return a sorted copy of the passed-in string92
93
*/94
95
protected static String sort(String string) {96
97
char[] charArray = string.toCharArray();98
99
100
java.util.Arrays.sort(charArray);101
102
103
return new String(charArray);104
105
}106
107
108
public static void main(String[] args) {109
110
String string1 = "Cosmo and Laine:";111
112
String string2 = "Maid, clean soon!";113
114
115
System.out.println();116
117
System.out.println("Testing whether the following "118
119
+ "strings are anagrams:");120
121
System.out.println(" String 1: " + string1);122
123
System.out.println(" String 2: " + string2);124
125
System.out.println();126
127
128
if (areAnagrams(string1, string2)) {129
130
System.out.println("They ARE anagrams!");131
132
} else {133
134
System.out.println("They are NOT anagrams!");135
136
}137
138
System.out.println();139
140
}141
142
}143
144
145
/*146
147
* Copyright (c) 1995, 2008, Oracle and/or its affiliates. All rights reserved.148
149
*150
151
* Redistribution and use in source and binary forms, with or without152
153
* modification, are permitted provided that the following conditions154
155
* are met:156
157
*158
159
* - Redistributions of source code must retain the above copyright160
161
* notice, this list of conditions and the following disclaimer.162
163
*164
165
* - Redistributions in binary form must reproduce the above copyright166
167
* notice, this list of conditions and the following disclaimer in the168
169
* documentation and/or other materials provided with the distribution.170
171
*172
173
* - Neither the name of Oracle or the names of its174
175
* contributors may be used to endorse or promote products derived176
177
* from this software without specific prior written permission.178
179
*180
181
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS182
183
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,184
/**代码未完, 请加载全部代码(NowJava.com).**/执行结果：
本文系作者在时代Java发表，未经许可，不得转载。如有侵权，请联系nowjava@qq.com删除。
编辑于
关注时代Java