String[] str = {"12","121"};        String[] str1 = {"12","121"};        String[] str2 = {"12","121","122"};        String[] str3 = {"123","1234","125","126","111"};        String[] str4 = {"1234","126","125","1232","111"};        String[] str6 = {"12","121","222","1433","1234","126","125","1232"};

package csdn;import java.util.ArrayList;import java.util.HashMap;import java.util.HashSet;import java.util.Iterator;import java.util.List;import java.util.Map;import java.util.Set;/** * 自己定义一个数据类型，用来模拟二进制计算 * @author sztsiang * */class Num{	private byte[] data;	private int length;	Num(int length){		data = http://www.mamicode.com/new byte[length];"contains:"+ t_value);				set.add(t_value);			}		}		return set;	}	/**	 * 返回一个字符串数组对应的符合次数	 * @param strs	 * @return count	 */	public int getEqualCount(String[] strs){		Set<Integer> set = null;		for(String str : strs){			Set<Integer> t_set = getSet(str);			set = (set == null ? t_set : combineSet(set, t_set));		}		return set.size();	}	/**	 * 把字符串数组变成一个字符串	 * @param args	 * @return String	 */	private String ArraysToString(String args[]){		StringBuilder sb = new StringBuilder();		sb.append("[");		int length = args.length;		for(int i = 0 ; i < length -1; i++){			sb.append(args[i] +", ");		}		sb.append(args[length-1]);		sb.append("]");		return sb.toString();	}	/**	 * 打印	 * @param str	 * @param count	 */	private void printResult(String str, int count){		if(count > 1)//当大于一次的时候输出,如果想都输出就不写if			System.out.println(str + "==>" + count);	}	/**	 * 生成key的各种组合可能，并计算该组合出现的次数	 */	public void Traversal(){		List<String> list  = new ArrayList<String>(map.keySet());		int list_size = list.size();		Num n = new Num(list.size());		int index = 0;		String str[];		while(n.increase()){			index = 0;			int t = n.getCount();			str = new String[t];			for(int i = 0; i < list_size; i++){				if(n.get(i) == 1) str[index++] = list.get(i);			}			int equal_count = getEqualCount(str);			printResult(ArraysToString(str), equal_count);		}	}	/**	 * main	 * @param args	 */	public static void main(String args[]){		String[] str = {"12","121"};        String[] str1 = {"12","121"};        String[] str2 = {"12","121","122"};        String[] str3 = {"123","1234","125","126","111"};        String[] str4 = {"1234","126","125","1232","111"};        String[] str6 = {"12","121","222","1433","1234","126","125","1232"};		EqualAndCount eac = new EqualAndCount();		eac.add(str);		eac.add(str1);		eac.add(str2);		eac.add(str3);		eac.add(str4);		eac.add(str6);		eac.Traversal();//自己组合所有的可能，然后查看次数		System.out.println(eac.getEqualCount(str));		System.out.println( eac.getEqualCount(str2));		System.out.println(eac.getEqualCount(new String[]{"1234", "126", "125","111"}));		System.out.println(eac.getEqualCount(new String[]{"1234", "126", "125"}) + "<<<");		System.out.println(eac.getEqualCount(new String[]{"111"}));		System.out.println(eac.getEqualCount(new String[]{"1433","111"}));			}}