leetcode-Longest Substring Without Repeating Characters
来源:互联网 发布:tensorflow test 编辑:程序博客网 时间:2024/06/05 11:32
question:
my thinking:
首先明确最终要得到最长不重复字符串的长度,就要记录下最长不重复字符串的起始位置和结束位置(当然可能很多朋友有别的更好的做法,觉得不需要这些也可以,不过这样的一个好处是我们还可以知道是哪个字串是我们要求的最长字串,虽然题目没有要求,但是说不定面试的时候面试官就会加上这一问呢,这里也就相当于是给自己加点难度吧)
那么接下来的操作就是通过改变start和end的下标值来确定我们的答案了。
从头开始遍历string,如果发现此时的字母还没有在之前最长的字串里出现过,就增加end的值,当然如果此时已经到了string的末尾就直接计算max_len和此时字串的长度的max值返回就可以了;
如果此时的字幕已经在之前的字符串里出现过了,那么就更新一下max_len的值,并且改变之前最长字串的start后第一个非该字母的位置,改变end为当前的下标
my Answer:
还是那句话,个人拙见,还希望和各位朋友多多交流
0 0
- LeetCode: Longest Substring Without Repeating Characters
- LeetCode Longest Substring Without Repeating Characters
- LeetCode: Longest Substring Without Repeating Characters
- [Leetcode] Longest Substring Without Repeating Characters
- leetcode 23: Longest Substring Without Repeating Characters
- [LeetCode] Longest Substring Without Repeating Characters
- LeetCode 3 - Longest Substring Without Repeating Characters
- [LeetCode]Longest Substring Without Repeating Characters
- leetcode Longest Substring Without Repeating Characters
- 【leetcode】 Longest Substring Without Repeating Characters
- LeetCode-Longest Substring Without Repeating Characters
- [LeetCode] Longest Substring Without Repeating Characters
- [LeetCode] Longest Substring Without Repeating Characters
- [leetcode] Longest Substring Without Repeating Characters
- LeetCode - Longest Substring Without Repeating Characters
- LeetCode 3: Longest Substring Without Repeating Characters
- leetcode-3:Longest Substring Without Repeating Characters
- leetcode之Longest Substring Without Repeating Characters
- 字符串常见笔试题
- listview中显示两种不同的item
- WinHttp流量跟踪方法
- 基于linux多线程调试分析的ecos多任务调试设计
- Android控件Gallery3D效果
- leetcode-Longest Substring Without Repeating Characters
- hdu 1712 ACboy needs your help(分组背包)
- 关于Struts-JSON的提高开发效率
- 在ubuntu12.04下搭建hadoop 环境(hadoop 2.0以上按此方法均可)
- oracle 11g expdp和impdp (数据泵)
- MarkDown 语法学习
- 手机信号中的G,E,H,T等代表的含义
- 核心期刊
- Xcode The Simulator can't be launched because it is already in use .