华为机试---字符串中所有子串的集合

package huawei;

import java.util.Iterator;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

/**
 * 功能描述：查找一个字符串的子字符串集  
 * 输入：abab 输出：a b ab ba aba bab
 * @author USER
 *
 */
public class FindSubString {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String string = in.nextLine();
		findAllSub(string);
	}

	private static void findAllSub(String string) {
		// TODO Auto-generated method stub
		Set<String> set = new TreeSet<String>();
		for (int i = 0; i < string.length()-1; i++) {
			for (int j = i+1; j < string.length(); j++) {
				String sub = string.substring(i,j);
				set.add(sub);
				
				//包含最后一个字符且不含整个字符串的子串
				if (j == string.length()-1 && i != 0) {
					set.add(string.substring(i));
				}
			}
		}
		
		Iterator<String> it = set.iterator();
		while (it.hasNext()) {
			String str = it.next();
			System.out.print(str+" ");
		}
	}
}