牛客网的一道算法题,自己写的java实现并通过测试。例如输入aaaaavvvvvvvvvcccc,则输出vvvvvvvvv;输入asdczxcweqwe,输出a
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner =new Scanner(System.in);
while (scanner.hasNext()) {
String line =scanner.nextLine();
char[] chars=line.toCharArray();
int length=chars.length;
int maxlength=0;
//结果
String maxSubstring="";
//暂存最长字符串的始末位
int begin=0,end=1;
//暂存最长字符,用来比较ascii码
char c=' ';
for (int i=0;i<length;i++){
if (i==0){
c=chars[0];
maxSubstring=c+"";
maxlength=1;
}else{
if (chars[i]==chars[i-1]){