题目要求
C++代码
class Solution {
public:
int lengthOfLongestSubstring(string s) {
int res=0,len=0,v[200];
memset(v,0,sizeof(v));
for(int i=0;i<s.length();i++)
{
for(int j=i;j<s.length();j++)
{
if(v[s[j]]==0)
{
len++;
v[s[j]]=1;
}
else
break;
}
res=max(res,len);
memset(v,0,sizeof(v));
len=0;
}
return res;
}
};
C#代码
public class Solution {
public int LengthOfLongestSubstring(string s) {
int[] last = new int[128];
for (int i = 0; i < last.Length; i++) {
last[i] = -1;
}
int left = -1;
int ans = 0;
for (int i = 0; i < s.Length; i++) {
left = Math.Max(left, last[s[i]]);
last[s[i]] = i;
ans = Math.Max(ans, i - left);
}
return ans;
}
}
执行结果
心得
不愧是中等难度的题!