Movatterモバイル変換


[0]ホーム

URL:


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

Sign up
Appearance settings

Commitc2fced0

Browse files
authored
Merge pull requestneetcode-gh#1021 from julienChemillier/patch-3
Add 5 in language c
2 parentsda1dd94 +0db3ba5 commitc2fced0

File tree

1 file changed

+42
-0
lines changed

1 file changed

+42
-0
lines changed

‎c/5-Longest-Palindromic-Substring.c

Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
1+
2+
/*
3+
Given a string s, return the longest palindromic substring in s.
4+
Time: O(n^2)
5+
Space: O(1)
6+
*/
7+
8+
char*longestPalindrome(char*s){
9+
intpos=0;
10+
intlenmax=1;
11+
for (inti=0;s[i]!='\0';i++){
12+
intg=i,d=i;
13+
while (g>=0&&s[d]!='\0'&&s[g]==s[d]){
14+
g-=1;
15+
d+=1;
16+
}
17+
d--;
18+
g++;
19+
if (d-g>=lenmax){
20+
lenmax=d-g+1;
21+
pos=g;
22+
}
23+
g=i,d=i+1;
24+
while (g>=0&&s[d]!='\0'&&s[g]==s[d]){
25+
g-=1;
26+
d+=1;
27+
}
28+
d--;
29+
g++;
30+
31+
if (d-g>=lenmax){
32+
lenmax=d-g+1;
33+
pos=g;
34+
}
35+
}
36+
char*new_s= (char*)malloc(sizeof(char)*(lenmax+1));
37+
new_s[lenmax]='\0';
38+
for (inti=0;i<lenmax;i++){
39+
new_s[i]=s[i+pos];
40+
}
41+
returnnew_s;
42+
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp