文章目录
字典序最小问题
字典序
:
思路:比较S串和S‘串(S的反串)大小,比较两个串的字典序大小,将小串的首部添加至T串尾部。
import java.util.Arrays;
import java.util.Scanner;
public class lanqiao1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
/*
StringBuilder ss = new StringBuilder();
for(int i=0;i<n;i++)
ss.append(sc.next());
f(ss.toString());
*/ //可以输入的形式为1. A C D B C B
//2. A
// C
// D
// B
// C
// B
String s = sc.next(); //输入形式 :ACDBCB
f(s);
}
private static void f(String s) {
String s1 = new StringBuilder(s).reverse().toString(); //s的反转字符串
StringBuilder rs = new StringBuilder();
int len = s.length();
while(rs.length() < len){
if(s.compareTo(s1) <= 0 ){
rs.append(s.charAt(0));
s = s.substring(1);
}
else{
rs.append(s1.charAt(0));
s1 = s1.substring(1);
}
}
System.out.println(rs.toString());
}
}