Leetcode 159 Longest Substring with At Most Two Distinct Characters
2016-01-30 07:24
411 查看
This question is quite simple. we do not even use the hash table, cause there just would be two distinct characters in the result string.
So we just need to use two integer to record the number for each character appears, and to record the characters
So we just need to use two integer to record the number for each character appears, and to record the characters
相关文章推荐
- Leetcode 249 Group Shifted Strings
- 【超详细教程】使用Windows Live Writer 2012和Office Word 2013 发布文章到博客园全面总结
- Window下的dos环境下编译运行下运行c程序
- Leetcode 314 Binary Tree Vertical Order Traversa
- Leetcode 274. H-Index
- Leetcode 299 Bulls and Cows
- 夺命雷公狗---微信开发18----删除自定义菜单
- tkinter的GUI设计:界面与逻辑分离(二)-- 菜单栏
- 夺命雷公狗---微信开发17----自定义菜单的事件推送,响应菜单的CLICK
- 数据挖掘博客收集
- localStorage
- linux shell编程零基础入门
- Broken Code
- canvas
- 夺命雷公狗---微信开发16----自定义菜单的查询
- 10大经典数据挖掘方法
- ORACLE SQL性能优化系列 (四)
- ORACLE SQL性能优化系列 (三)
- ORACLE SQL性能优化系列 (二)
- Trapping Rain Water (Bar Height) -- LeetCode