2019 9.15顺丰科技笔试字符串双节棍

最新推荐文章于 2022-09-28 15:45:51 发布

sherlockholmeto

最新推荐文章于 2022-09-28 15:45:51 发布

阅读量521

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/sherlockholmeto/article/details/82714006

本文介绍了一种用于识别双节棍字符串的算法，双节棍字符串是指形如“aaa...bb...aaa”的字符串，其左右两端为相同字符且数量相等，中间为另一重复的字符串。文章提供了Java实现代码，通过扫描输入字符串，识别并输出符合双节棍字符串特征的中间部分。

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

先贴下代码，等有空再把题目补上。

双节棍字符串：形如 “aaa....bb....aaa” 左右两端为相同的字符，且数量相等，中间为另一重复的字符串

比如输入 AAABDDDKDDDL 输出DDDKDDD


import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String str=in.nextLine();
        char [] ch=str.toCharArray();
        int one=0;
        Character oneChar=ch[0];
        int two=0;
        Character twoChar=null;
        int three=0;
        Character threeChar=null;
        String result=null;
        int sum=0;
        for (int i = 0; i < ch.length; i++) {
			if(i==0||(ch[i]==oneChar&&ch[i]==ch[i-1]&&oneChar!=threeChar)) {
				one++;
			}else if(twoChar==null) {
				twoChar=ch[i];
				two++;
			}else if(twoChar==ch[i]&&ch[i]==ch[i-1]) {
				two++;
			}else if(threeChar==null) {
				threeChar=ch[i];
				three++;
			}else if(threeChar==ch[i]&&ch[i]==ch[i-1]) {
				three++;
			}else {
				oneChar=twoChar;
				one=two;
				twoChar=threeChar;
				two=three;
				threeChar=ch[i];
				three=1;
			}
			if(one==three&&two<one) {
				if(one*2+two>sum) {
					StringBuilder sb=new StringBuilder();
					for (int j = 0; j < one; j++) {
						sb.append(oneChar);
					}
					for (int j = 0; j < two; j++) {
						sb.append(twoChar);
					}
					for (int j = 0; j < one; j++) {
						sb.append(threeChar);
					}
					sum=one*2+two;
					result=sb.toString();
					oneChar=threeChar;
					one=three;
					twoChar=null;
					two=0;
					threeChar=null;
					three=0;
			}
		}
        } 
        System.out.println(result);
        
    }
}