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
38 lines (36 loc) · 1.06 KB

File metadata and controls

38 lines (36 loc) · 1.06 KB
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
package leetcode.dp;
public class leetcode647 {
public int countSubstrings(String s) {
int res=0;
boolean dp[][]=new boolean[s.length()][s.length()];
for (int i = 0; i <s.length(); i++) {
for (int j = i; j >-1; j--) { //从i开始 考虑单字符
if (s.charAt(i)==s.charAt(j) &&((i-j)<2||dp[i-1][j+1])){
// (i-j)<2 j=i-1,j=i
dp[i][j]=true;
res++;
}
}
}
return res;
}
/*
* 中心拓展法=》回文问题
* */
public int countSubstrings2(String s) {
int count = 0;
int i;
for(i = 0; i < s.length(); i++){
count += countPalindrome(s, i, i);
count += countPalindrome(s, i, i + 1);
}
return count;
}
public int countPalindrome (String s, int left, int right){
int count = 0;
while(left >= 0 && right < s.length() && s.charAt(left--) == s.charAt(right++)){
count++;
}
return count;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.