java 笛卡尔积（循环）

 @SuppressWarnings({ "rawtypes", "unchecked" })
	public static List Dikaerji(List listSrc){
    	List listOne = (List) listSrc.get(0);
    	List result = new ArrayList();
    	for(int i = 1; i < listSrc.size(); i++){
    		List listTwo = (List)listSrc.get(i);
    		List temp = new ArrayList();
    		for(int j = 0; j < listOne.size(); j++){
    			for(int k = 0; k < listTwo.size(); k++){
    				List cut = new ArrayList();
    				if(listOne.get(j) instanceof List){
    					cut.addAll((List)listOne.get(j));
    				}else{
    					cut.add(listOne.get(j));
    				}
    				if(listTwo.get(k) instanceof List){
    					cut.addAll((List)listTwo.get(k));
    					System.out.println("OK");
    				}else{
    					cut.add(listTwo.get(k));
    				}
    				temp.add(cut);
    			}
    		}
    		listOne = temp;
    		result = temp;
    	}
    	return result;
    }