代码public class Solution { public int LengthOfLongestSubstring(string s) { int left, result; HashSetchar chars new HashSetchar(); left result 0; for (int right 0; right s.Length; right) { while (chars.Contains(s[right])) { chars.Remove(s[left]); left; } chars.Add(s[right]); result Math.Max(result, right - left 1); } return result; } }结果 LeetCode3.无重复字符的最长子串
代码public class Solution { public int LengthOfLongestSubstring(string s) { int left, result; HashSetchar chars new HashSetchar(); left result 0; for (int right 0; right s.Length; right) { while (chars.Contains(s[right])) { chars.Remove(s[left]); left; } chars.Add(s[right]); result Math.Max(result, right - left 1); } return result; } }结果 RELATED READING
延伸阅读
更多一线实战笔记与深度复盘，助您持续精进
