Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.
思路是建立表,将字符串转为字符数组,添加该数组第一个字符至表中,然后对后续数组内容进行遍历,如果contain跳出循环,否则添加下一个字符,知道跳出循环,最后得出list长度。但是对于该算法复杂度概念不足,不知道算不算简便。
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace longestsubstringwithoutrepeatcharacter
{
class Program
{
static void Main(string[] args)
{
Program p=new Program();
string teststring="ofdagslnglkrnqogfdsgrshtgejyterrtw";
int resu