forked from codemistic/Data-Structures-and-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetcode125.java
More file actions
44 lines (37 loc) · 1.02 KB
/
Leetcode125.java
File metadata and controls
44 lines (37 loc) · 1.02 KB
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
44
package com.company;
public class Leetcode125 {
public static void main(String[] args) {
String s="OP";
System.out.println(palin(s));
}
static boolean palin(String s) {
StringBuilder s1 = new StringBuilder();
for (int i = 0; i < s.length(); i++) {
char ch = Character.toLowerCase(s.charAt(i));
if (ch >= 97 && ch <= 122 || ch >= 48 && ch <= 57) {
s1.append(ch);
}
}
StringBuilder s2 = new StringBuilder(s1);
reverse(s2);
if (s1.toString().equals(s2.toString())) {
return true;
} else {
return false;
}
}
static void reverse(StringBuilder s){
int start=0,end=s.length()-1;
while(end>start){
swap(s,start,end);
start++;
end--;
}
}
static void swap(StringBuilder s,int a,int b){
char temp;
temp=s.charAt(a);
s.setCharAt(a,s.charAt(b));
s.setCharAt(b,temp);
}
}