forked from 14visheshjain/DataStructure-Algorithm-in-java
-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathsubstring.java
More file actions
37 lines (30 loc) · 780 Bytes
/
substring.java
File metadata and controls
37 lines (30 loc) · 780 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
33
34
35
36
37
package lecture9a11;
import java.util.Scanner;
public class substring {
public static void main(String[] args) {
Scanner a = new Scanner(System.in);
String s = a.next();
int count = s.length();
System.out.println(palindrome(s));
}
public static int palindrome(String s) {
int count = 0;
for (int i = 0; i < s.length(); i++) {
for (int orbit = 0; orbit + i < s.length() && i - orbit >= 0; orbit++) {
if (s.charAt(i - orbit) == s.charAt(i + orbit))
count++;
else
break;
}
}
for (float i = 0.5f; i < s.length(); i++) {
for (float orbit = 0.5f; orbit + i < s.length() && i - orbit >= 0; orbit++) {
if (s.charAt((int)(i - orbit)) == s.charAt((int)(i + orbit)))
count++;
else
break;
}
}
return count;
}
}