Circular Sequence

最新推荐文章于 2021-12-24 09:56:02 发布

X~R

最新推荐文章于 2021-12-24 09:56:02 发布

阅读量189

点赞数

CC 4.0 BY-SA版权

分类专栏： string

本文链接：https://blog.csdn.net/weixin_44744037/article/details/99977228

string 专栏收录该内容

11 篇文章

订阅专栏

本文探讨了如何将循环DNA序列转换为线性形式，并找到其所有可能线性表示中最短的字典序序列。通过将序列复制并连接，再对比子串，实现了从输入的循环序列中找出字典序最小的线性序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Some DNA sequences exist in circular forms as in the following figure, which shows a circular sequence “CGAGTCAGCT”, that is, the last symbol “T” in “CGAGTCAGCT” is connected to the first symbol “C”. We al- ways read a circular sequence in the clockwise direction.

Since it is not easy to store a circular sequence in a com- puter as it is, we decided to store it as a linear sequence. However, there can be many linear sequences that are ob- tained from a circular sequence by cutting any place of the circular sequence. Hence, we also decided to store the linear sequence that is lexicographically smallest among all linear sequences that can be obtained from a circular sequence.

Your task is to find the lexicographically smallest sequence
from a given circular sequence. For the example in the figure,
the lexicographically smallest sequence is “AGCTCGAGTC”. If there are two or more linear sequences that are lexicographically smallest, you are to find any one of them (in fact, they are the same).

Input

The input consists of T test cases. The number of test cases T is given on the first line of the input file. Each test case takes one line containing a circular sequence that is written as an arbitrary linear sequence. Since the circular sequences are DNA sequences, only four symbols, ‘A’, ‘C’, ‘G’ and ‘T’, are allowed. Each sequence has length at least 2 and at most 100.

Output

Print exactly one line for each test case. The line is to contain the lexicographically smallest sequence for the test case.

Sample Input

2
CGAGTCAGCT
CTCC

Sample Output

AGCTCGAGTC
CCCT

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <stack>
#include <map>
#define ull unsigned long long
#define ll long long

using namespace std;

char x[110],y[110];

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        getchar();
        scanf("%s",x);
        int n=strlen(x);
        strcpy(y,x);
        strcat(x,y);//在x后接上y字符串
        for(int i=0;i<n;i++)
        {
            if(strncmp(y,x+i,n)>0)//strncmp()同样n长度两字符串比较大小
            {
                strncpy(y,x+i,n);
            }
        }
        printf("%s\n",y);
    }
    return 0;
}