首页 > 其他 > 详细

LeetCode "Substring with Concatenation of All Words"

时间:2014-08-08 15:33:46      阅读:317      评论:0      收藏:0      [点我收藏+]

"that are all of the same length" is the key. This statement makes everything much simpler. And, please take care that L may contain duplicated strings.

My main reference is: http://yucoding.blogspot.com/2013/09/leetcode-question-106-substring-with.html

Remember: feel the problem first.. then look up your armory

LeetCode "Substring with Concatenation of All Words",布布扣,bubuko.com

LeetCode "Substring with Concatenation of All Words"

原文:http://www.cnblogs.com/tonix/p/3899211.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!