Find Peak Element,Longest Substring Without Repeating Characters
2014-12-05 16:10
459 查看
Find Peak Element
根据题目描述可知，相邻元素不相同，有且只有一个峰值（这个峰值一定是最大值，不过分析出该条件没有用，哈哈）
只需寻找峰值即可，二分，每次比较中点及与中点相邻的元素即可（因为相邻元素不相同）
细节处理：区间只有两个或一个元素的时候
Longest Substring Without Repeating Characters
（回想KMP算法，不太像，领会精神）
用一个map存储出现过的字符的位置即可，时间复杂度O(n)
根据题目描述可知，相邻元素不相同，有且只有一个峰值（这个峰值一定是最大值，不过分析出该条件没有用，哈哈）
只需寻找峰值即可，二分，每次比较中点及与中点相邻的元素即可（因为相邻元素不相同）
细节处理：区间只有两个或一个元素的时候
Longest Substring Without Repeating Characters
（回想KMP算法，不太像，领会精神）
用一个map存储出现过的字符的位置即可，时间复杂度O(n)
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Given a string, find the length of the longest substring without repeating characters
- LeetCode : Given a string, find the length of the longest serial substring without repeating characters.
- 3. Longest Substring Without Repeating Characters
- 3. 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
- (算法分析Week19)Longest Substring Without Repeating Characters 最长无重复子串 [Medium]
- LeetCode Longest Substring Without Repeating Characters
- LeetCode3：Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- 3. Longest Substring Without Repeating Characters
- 【LeetCode】003 Longest Substring Without Repeating Characters 最长的没有重复的子字符串
- LeetCode3-Longest Substring Without Repeating Characters
- [leetcode3] Longest Substring Without Repeating Characters
- LeetCode：Longest Substring Without Repeating Characters
- [LeetCode]-algorithms-Longest Substring Without Repeating Characters
- LeetCode之Longest Substring Without Repeating Characters
- 【leetcode】003 Longest Substring Without Repeating Characters