package demo;
public class Test {
  public static void main(String[] args) {
    String str = "dasdalldsdslldsdszxll";
    System.out.println("count="+get(str,"ll"));//打印ll出現(xiàn)的次數(shù)
    String s1 = "asdhellovdvdvv";
    String s2 = "cvfhelloff";
    System.out.println("temp="+gett(s1,s2));//打印兩個(gè)字符串最大相同的部分
  }
  /* public static int get(String str,String key)
  {
    int count = 0;
    int index = 0;//定義一個(gè)位置
    while((index = str.indexOf(key))!=-1)//直到取不到需要的字符結(jié)束循環(huán)
    {
      str = str.substring(index + key.length());//字符串長度變化獲得新的字符串
      count++;
    }
    return count;
  }
  */
  //第二種方法，大同小異
  public static int get(String str,String key)
  {
    int count = 0;
    int index = 0;
    while((index = str.indexOf(key,index))!=-1)
    {
      index = index + key.length();
      count ++;
    }
    return count;
  }
  public static String gett(String s1,String s2)
  {
    String max = "";
    String min = "";
    max = s1.length() > s2.length()?s1:s2;
    min = max == s1?s2:s1;//取短的字符串比較節(jié)省內(nèi)存
    for(int x = 0;x < min.length();x++)
    {
      for(int y = 0,z = min.length() -x;z!=min.length()+1;y++,z++)
      {
        String temp = min.substring(y,z);
        if(max.contains(temp))
          return temp;
      }
    }
    return "";
  }
}