HDU-3374: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 strings: String Rank SKYLONG 1 KYLONGS 2 YLONGSK 3...
原创
2018-05-20 17:23:17 ·
471 阅读 ·
0 评论