字符串
文章平均质量分 87
zoey-lyly
这个作者很懒,什么都没留下…
展开
-
Number Sequence
Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2],原创 2017-10-10 17:22:14 · 268 阅读 · 0 评论 -
Clairewd’s message
Problem Description Clairewd is a member of FBI. After several years concealing in BUPT, she intercepted some important messages and she was preparing for sending it to ykwd. They had agreed that e原创 2017-11-11 16:29:00 · 678 阅读 · 0 评论 -
最长回文
给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度. 回文就是正反读都是一样的字符串,如aba, abba等 Input 输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c...y,z组成的字符串S 两组case之间由空行隔开(该空行不用处理) 字符串长度len Output 每一行原创 2017-11-18 20:42:34 · 196 阅读 · 0 评论 -
String Problem
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原创 2017-11-14 19:10:29 · 600 阅读 · 0 评论