You're given a string of lower-case Latin letters. Your task is to find the length of its longest su



C - You're Given a String...

 

 代码：

import java.util.Arrays;
import java.util.Scanner;

public class Main {

public static void main(String[] args){
  int count=1,k=0,max=0,i=0;
  int[] sum=new int[100];
  Scanner scan=new Scanner(System.in);
  char[] s=scan.next().toCharArray();
  for(i=0;i<s.length;i++){
     for(int j=s.length-1;j>i;j--){
      if(s[i]==s[j]){
      count++;
      }
   }
     for(i=0;i<s.length;i++){
         sum[i]=count;
     }
  }
    Arrays.sort(sum, 0, s.length-1);
    if(sum[s.length-1]==s.length&&s.length>2){
     System.out.print(s.length-1+"");
    }
    else if(sum[s.length-1]!=s.length&&sum[s.length-1]>=2){
    System.out.print(sum[s.length-1]+"");
    }
    else{
     System.out.print("0");
    }
 } 
}