Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
43 lines (33 loc) · 877 Bytes

File metadata and controls

43 lines (33 loc) · 877 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
33
34
35
36
37
38
39
40
41
42
43
package chapter9;
import java.util.ArrayDeque;
import java.util.Deque;
/**
* 查找回文串
*/
public class FindPalindrome {
private Deque<Character> ds;
FindPalindrome(String str) {
ds = new ArrayDeque<>();
for (int i = 0; i < str.length(); i++) {
ds.add(str.charAt(i));
}
}
public boolean check() {
boolean flag = true;
while(ds.size() > 1) {
if (ds.pollFirst() != ds.pollLast()) {
flag = false;
}
}
return flag;
}
public static void main(String[] args) {
String[] words = {"RADAR", "WARTER START", "MILK KLIM", "RESERVERED", "IWI"};
for (String s: words) {
FindPalindrome fp = new FindPalindrome(s);
if (fp.check()) {
System.out.println(s);
}
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.