-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetcode5.cpp
More file actions
188 lines (161 loc) · 4.95 KB
/
Leetcode5.cpp
File metadata and controls
188 lines (161 loc) · 4.95 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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
// Leetcode5.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include <iostream>
#include <string>
#include <vector>
using namespace::std;
string longestPalindrome(string s)
{
int maxLength = 0;
string maxString = "";
if (1 == s.size())
return s;
for (auto it = s.begin(); it != s.end(); ++it)
{
int lengthTmp = 0;
string stringTmp = "";
if (it == s.begin())
{
if (*it == *(it + 1))
{
lengthTmp = 2;
stringTmp = s.substr(it - s.begin(), lengthTmp);
}
else
{
lengthTmp = 1;
stringTmp = s.substr(it - s.begin(), lengthTmp);
}
}
else if (it == s.end() - 1)
{
lengthTmp = 1;
stringTmp = s.substr(it - s.begin(), lengthTmp);
}
else
{
auto its = it, ite = it;
while (ite != s.end())
{
if (*its == *ite)
{
if (its == s.begin())
{
lengthTmp = ite + 1 - its;
stringTmp = s.substr(its - s.begin(), lengthTmp);
break;
}
its -= 1;
ite += 1;
}
else
{
lengthTmp = ite - (its + 1);
stringTmp = s.substr(its + 1 - s.begin(), lengthTmp);
break;
}
}
if (ite == s.end())
{
lengthTmp = ite - (its + 1);
stringTmp = s.substr(its + 1 - s.begin(), lengthTmp);
}
int lengthTmp1 = 0;
string stringTmp1 = "";
if (*it == *(it + 1))//even palindrome
{
auto its = it, ite = it + 1;
while (ite != s.end())
{
if (*its == *ite)
{
if (its == s.begin())
{
lengthTmp1 = ite + 1 - its;
stringTmp1 = s.substr(its - s.begin(), lengthTmp1);
break;
}
its -= 1;
ite += 1;
}
else
{
lengthTmp1 = ite - (its + 1);
stringTmp1 = s.substr(its + 1 - s.begin(), lengthTmp1);
break;
}
}
if (ite == s.end())
{
lengthTmp1 = ite - (its + 1);
stringTmp1 = s.substr(its + 1 - s.begin(), lengthTmp1);
}
}
if (lengthTmp <= lengthTmp1)
{
lengthTmp = lengthTmp1;
stringTmp = stringTmp1;
}
}
if (maxLength<= lengthTmp)
{
maxLength = lengthTmp;
maxString = stringTmp;
}
}
return maxString;
}
string longestPalindromeBetter(string s)
{
int len = s.size();
vector<vector<int>> dp;
for (int i = 0; i < len; ++i)
{
vector<int> dp1(len, 0);
dp.push_back(dp1);
}
//int dp[len][len];
//memset(dp, 0, sizeof(dp));
int end = 1;
int start = 0;
for (int i = 0; i < len; i++) //length = 1
{
dp[i][i] = 1;
}
for (int i = 0; i < len - 1; i++) //length = 2
{
if (s[i] == s[i + 1])
{
dp[i][i + 1] = 1; start = i; end = 2;
}
}
for (int j = 2; j < len; j++) //length = 3, 4, 5.....
{
for (int i = 0; i < len - j; i++)
{
int left = i; //start point
int right = i + j; //ending point
if (dp[left + 1][right - 1] == 1 && s[left] == s[right])
{
dp[left][right] = 1; start = i; end = j + 1;
}
}
}
return s.substr(start, end);
}
int main()
{
string a = "cbbd";
//string result = longestPalindrome(a);
string result = longestPalindromeBetter(a);
std::cout << "Hello World!\n";
}
// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu
// Tips for Getting Started:
// 1. Use the Solution Explorer window to add/manage files
// 2. Use the Team Explorer window to connect to source control
// 3. Use the Output window to see build output and other messages
// 4. Use the Error List window to view errors
// 5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
// 6. In the future, to open this project again, go to File > Open > Project and select the .sln file