Given a string, the string is determined whether to include a string. If included, all occurences substrings determined number of occurrences and

public static int getoccur(String src, String find) {
	int cs = 0;
	int index = -1;
	while ((index = src.indexOf(find, index)) > -1) {
		++index;
		++cs;
	}
	return cs;

}

public static void getoccur1(String src, String find) {
	boolean cz = true; // 判断是否存在字串
	if (!src.contains(find)) {
		cz = false;
	}
	if (cz) {// 如果存在
		int h = 0;
		System.out.print("该子串的位置为：");
		while (true) {
			int pos = src.indexOf(find);
			if (pos == -1) {
				break;
			}
			System.out.print((pos + h));// 字串位置
			System.out.print(" ");
			src = src.substring(pos + find.length());// 截取位置
			h += (pos + find.length());
		}
		// if (!src.contains(find)){
		// h = -1;
		// }else{
		// // 证明包含这些字符串 位置从0开始
		// h = src.indexOf(find) ;
		// }a
		// System.out.print("该子串的位置为："+h);
	} else {
		System.out.println("不包含该字串");
	}

}

public static void main(String[] args) {
System.out.println("该子串出现次数为:" + getoccur("abchdjfhabcsdbakb", "abc")
			+ "次");
	getoccur1("abchdjfhabcsdbakb", "abc");


}