package me.chunsheng.javatest;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
/**
 * Created by wei_spring on 16/10/11.
 * <p>
 * 統(tǒng)計一個字符串在另外一個字符串出現(xiàn)的次數(shù)
 * 正則匹配的方法,前提字符串不是特殊字符串
 * eg:finder("adadadadauuada", "ada") 這樣會統(tǒng)計不準(zhǔn)確的.
 * 另外一個遍歷的解決了上面那種情況.
 * 兩者時間如下(納秒為單位): 正則明顯耗時,正則本就不是統(tǒng)計用的!!!
 * finder:3
 * finderTime:1579549
 * getCount:4
 * getCountTime:34506
 */
public class SubStringCount {
  public static void main(String[] args) {
    System.out.println("腳本之家測試結(jié)果：");
    long current1 = System.nanoTime();
    System.out.println("finder:" + finder("adadadadauuada", "ada"));
    System.out.println("finderTime:" + (System.nanoTime() - current1));
    long current2 = System.nanoTime();
    System.out.println("getCount:" + getCount("adadadadauuada", "ada"));
    System.out.println("getCountTime:" + (System.nanoTime() - current2));
  }
  public static int getCount(String source, String sub) {
    int count = 0;
    int length = source.length() - sub.length();
    for (int i = 0; i < length; i++) {
      String sourceBak = source.substring(i, i + sub.length());
      int index = sourceBak.indexOf(sub);
      if (index != -1) {
        count++;
      }
    }
    return count;
  }
  public static int finder(String source, String regexStr) {
    String regex = "[a-zA-Z]+";
    if (regexStr != null && !regexStr.equals("")) {
      regex = regexStr;
    }
    Pattern expression = Pattern.compile(regex);
    Matcher matcher = expression.matcher(source);
    int n = 0;
    while (matcher.find()) {
      n++;
    }
    return n;
  }
}