mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
Create 3.cpp
This commit is contained in:
parent
f13c712efa
commit
efb59f18ec
38
LeetCode-CN/3.cpp
Normal file
38
LeetCode-CN/3.cpp
Normal file
@ -0,0 +1,38 @@
|
||||
#include <cstdlib>
|
||||
#include <cstring>
|
||||
class Solution {
|
||||
public:
|
||||
int lengthOfLongestSubstring(string s) {
|
||||
int sz = s.size();
|
||||
int bin[256];
|
||||
int maxlen = 0;
|
||||
int clen = 0;
|
||||
int L = 0;
|
||||
while (L < sz)
|
||||
{
|
||||
memset(bin, 0, sizeof(int) * 256);
|
||||
int i;
|
||||
for (i = L; i < sz; i++)
|
||||
{
|
||||
if (bin[s[i]])
|
||||
{
|
||||
maxlen = clen > maxlen ? clen : maxlen;
|
||||
clen = 0;
|
||||
L++;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
bin[s[i]] = 1;
|
||||
clen++;
|
||||
}
|
||||
}
|
||||
if (i == sz)
|
||||
{
|
||||
maxlen = clen > maxlen ? clen : maxlen;
|
||||
break;
|
||||
}
|
||||
}
|
||||
return maxlen;
|
||||
}
|
||||
};
|
Loading…
x
Reference in New Issue
Block a user