LeetCode #3. Longest Substring Without Repeating Characters C#
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了LeetCode #3. Longest Substring Without Repeating Characters C#,小编现在分享给大家,供广大互联网技能从业者学习和参考。文章包含1738字,纯文字阅读大概需要3分钟。
内容图文
Given a string, find the length of the longest substring without repeating characters.
Examples:
Given "abcabcbb"
, the answer is "abc"
, which the length is 3.
Given "bbbbb"
, the answer is "b"
, with the length of 1.
Given "pwwkew"
, the answer is "wke"
, with the length of 3. Note that the answer must be a substring, "pwke"
is a subsequence and not a substring.
Solution:
Use two-pointer and HashTable to solve.
Keep p1 at the beginning of the substring and move p2, add characters to hash table and keep the index as value,
if map contains s[p2] then need to move p1 to the right of the duplicated char index, then update the index of map[s[p2]] to p2;
also p1 and p2 should only move forward;
ex) "abba" when p1=0, p2 = 2, we met the second ‘b‘ then p1 should move to 2, and p2 stay at 2.
then when p1=2, p2=3 we met the second a, p1 should never move back to index 1 to start over;
Before come up with this solution, my solution was to clear the map and move p1 to the right of the first duplicated char, and same to p2 then go through again and add to map,
This method worst case runtime is O(n2), so exceeded the time Limited
1 public class Solution { 2 public int LengthOfLongestSubstring(string s) { 3if(string.IsNullOrEmpty(s)) 4 { 5return0; 6 } 7int l = s.Length; 8int max = 0; 9int p1=0; 10int p2=0; 11 Dictionary<char,int> map = new Dictionary<char,int>(); 12while(p2<l) 13 { 14if(!map.ContainsKey(s[p2])) 15 { 16 map.Add(s[p2], p2); 17 } 18else19 { 20if(p1<=map[s[p2]]) 21 { 22 p1=map[s[p2]]+1; 2324 } 25 map[s[p2]]= p2; 26 } 27 max= Math.Max(max, p2-p1+1); 28 p2++; 2930 } 31return max; 32 } 33 }
原文:http://www.cnblogs.com/MiaBlog/p/6127857.html
内容总结
以上是互联网集市为您收集整理的LeetCode #3. Longest Substring Without Repeating Characters C#全部内容,希望文章能够帮你解决LeetCode #3. Longest Substring Without Repeating Characters C#所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错,欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 gblab@vip.qq.com 举报,一经查实,本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。