第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-87 字串统计

#include<stdio.h>
#include<string.h>
int main(){
	char S[1000],str[1000][1000],temp[100],out[100];
	int L,i=0,s,otongji=0,ttongji,a,b,c;
	scanf("%d%c%c",&L,&S[0],&S[0]);
	while(S[i]!='\n'){
                           scanf("%c",&S[i+1]);
                           i++;
                           }
    S[i] = '\0';
    for(s=i+1;L<=s;L++){
                        for(a=0;a<s+1-L;a++){//赋值 
                                             for(b = 0;b < L;b++){
                                                   str[a][b]=S[a+b];
                                             }
                                             str[a][b] = '\0';
                        }
                        
                        
                        for(i = 0;i < a-1;){//比较 
                              for(b = 0;b<a;b++){
                                    if(str[b][0]!='\0'){
                                          for(c = 0;c<L;c++){
                                                temp[c]=str[b][c];
                                          }
                                          temp[c] = '\0';
                                          ttongji = 1;
                                          i++;
                                          str[b][0] = '\0';
                                          break;
                                    }
                              }
                              for(b++;b<a;b++){
                                     if(!strcmp(str[b],temp)){
                                          ttongji++;
                                          i++;
                                          str[b][0] = '\0';
                                     }
                              } 
                              if(ttongji > otongji||(ttongji==otongji&&strlen(temp)>strlen(out))){
                                    strcpy(out,temp);
                                    otongji = ttongji;
                              }
                        }
                        
                        
    }
    i = 0;
    while(out[i] != '\0'){
            printf("%c",out[i]);
            i++;
            }
    getchar();
	return 0;
}

#include<cstdio>
#include<cstring>
int main()
{
	char s[65],str[65];
	int max=0,t,n,len;
	scanf("%d%s",&n,s);
	len=strlen(s);
	if(n<=len)
	{
		char ss[65],tt[65];
		for(int i=len;i>=n;i--)
		{
			ss[i]=tt[i]='\0';
			for(int j=0;j<=len-i;j++)
			{
				t=1;
				for(int k=0;k<i;k++)
				    ss[k]=s[k+j];
				for(int x=j+1;x<=len-i;x++)
				{
					for(int y=0;y<i;y++)
					    tt[y]=s[y+x];
					if(strcmp(ss,tt)==0)
					   t++;    
				}
				if(t>max)
		        {
			       max=t;
			       strcpy(str,ss);
		        }    
			}
		}
		printf("%s\n",str);
	}
}

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;


public class Main {
	 public static void main(String[] args) {
	        Scanner scanner = new Scanner(System.in) ;
	        int l= scanner.nextInt();
	        String s = scanner.next();
	        //String 保存子串，int保存次数
	        Map<String, Integer> map = new HashMap<String,Integer>();
	        int maxValue = 0;//最大次数
	        String maxStr = "";//出现最大次数的子串
	        for (int i = 0; i < s.length()-l+1; i++) {
	            for (int j = i+l; j < s.length(); j++) {
	                String string = s.substring(i, j);//枚举截取长度大于等于l的字符串
	                    if (map.containsKey(string)) {//若该字符串之前出现过则map(key,value)中value值+1
	                    int value = map.get(string);
	                    value++;
	                    if (value>maxValue) {
	                        maxValue = value;
	                        maxStr = string;
	                    }else if(value == maxValue){
	                        if (maxStr.length() < string.length()) { //若该字符串出现的次数与当前出现次数最多的字符串相等，则比较两个字符串的长度，取字符串长的
	                            maxStr = string;
	                        }
	                    }
	                    map.put(string, value);
	                }else{//若该字符串之前并未出现过则添加，并初始化value值为0
	                    map.put(string, 0);
	                }
	            }
	        }
	        System.out.println(maxStr);
	    }

}

dict={}

L=int(input())
S=str(input())
for i in range(len(S)):
    for j in range(i+L,len(S)+1):
        Str=S[i:j]
        if Str in dict:
            dict[Str]+=1
        else:
            dict[Str]=1

hist=list(dict.items())
hist.sort(key=lambda x:(x[1],len(x[0])),reverse=True)

print(hist[0][0])