摘要: You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found 阅读全文
posted @ 2019-09-07 22:21 进击的黑仔 阅读(264) 评论(0) 推荐(1) 编辑
摘要: You may have wondered why most extraterrestrial life forms resemble humans, differing by superficial traits such as height, colour, wrinkles, ears, ey 阅读全文
posted @ 2019-09-07 22:13 进击的黑仔 阅读(207) 评论(0) 推荐(0) 编辑
摘要: The repetition number of a string is defined as the maximum number R such that the string can be partitioned into R same consecutive substrings. For e 阅读全文
posted @ 2019-09-07 22:06 进击的黑仔 阅读(234) 评论(0) 推荐(0) 编辑
摘要: 题面就不弄了 题意:给你一个串,让你求出补充最少的字符形成的回文串 思路:思路很好想,就是对一个串,找其最后一个字符(第一个也行)和原串的反串的最长公共前缀,这样就求出了该串中的已有最长回文,然后把剩下部分 倒序添加到原串上即可。 也就是我们可以固定一个位置,即使反串的第一个单词(原串最后一个),然 阅读全文
posted @ 2019-09-07 21:48 进击的黑仔 阅读(173) 评论(0) 推荐(0) 编辑
摘要: Given a sequence, {A1, A2, ..., An} which is guaranteed A1 > A2, ..., An, you are to cut it into three sub-sequences and reverse them separately to fo 阅读全文
posted @ 2019-09-07 21:28 进击的黑仔 阅读(224) 评论(0) 推荐(0) 编辑