2017年4月9日
P - How many
摘要： Give you n ( n < 10000) necklaces ,the length of necklace will not large than 100,tell me How many kinds of necklaces total have.(if two necklaces can 阅读全文
posted @ 2017-04-09 22:44 joeylee97 阅读(249) 评论(0) 推荐(0)
O - String Problem KMP 字符串最小表示法
摘要： Give you a string with length N, you can generate N strings by left shifts. For example let consider the string “SKYLONG”, we can generate seven strin 阅读全文
posted @ 2017-04-09 22:16 joeylee97 阅读(496) 评论(0) 推荐(0)