Leetcode003

题目链接：https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/

#include 
#include
#include
int vis[1000];
using namespace std;
class Solution {
public:
    int lengthOfLongestSubstring(string s) {
            int Len=s.length();
            int ans=0,k=0;
            memset(vis,0,sizeof(vis));
            for(int i=0;i>s;
    Solution a;
    int ans=a.lengthOfLongestSubstring(s);
    cout<