大家好，想達(dá)到如下目的，List1 {"A1", "A2", "A3", "A4"}List2 {"B1", "B2", "B3", "B4", "B5"}List3 {"C1", "C2", "C3", "C4", "C5"}List4 {"D1", "D2", "D3"}List5 {"E1", "E2", "E3", "E4"}List6 {"F1", "F2", "F3", "F4", "F5"}A1,B1,C1,D1,E1,F1A1,B1,C1,D1,E1,F2A1,B1,C1,D1,E1,F3...A1,B1,C1,D1,E2,F1A1,B1,C1,D1,E2,F2A1,B1,C1,D1,E2,F3...實(shí)現(xiàn)這樣的組合，除了6重循環(huán)外，有什么優(yōu)雅的寫(xiě)法嗎？
4 回答
浮云間
TA貢獻(xiàn)1829條經(jīng)驗(yàn) 獲得超4個(gè)贊
6重循環(huán)邏輯上更簡(jiǎn)單些，不想要這種寫(xiě)法也是可以的，給你個(gè)參考吧；
[code="java"]
import java.util.Arrays;
import java.util.List;
public class Mm {
/**
* @param args
*/
public static void main(String[] args) {
// int[] a = new int[] { 123, 11 };
List<String>[] t = new List[] { Arrays.asList("1", "2", "3", "4"),
Arrays.asList("a", "b", "c"), Arrays.asList("甲", "乙", "丙", "丁") };
int[] pos = new int[t.length];
while (!print(t, pos)) {
addpos(t, pos, pos.length - 1);
}
}
public static void addpos(List<String>[] t, int[] pos, int p_length) {
if (p_length < 0)
return;
if (pos[p_length] < t[p_length].size() - 1) {
pos[p_length] = pos[p_length] + 1;
} else {
pos[p_length] = 0;
addpos(t, pos, p_length - 1);
}
}
public static boolean print(List<String>[] t, int[] pos) {
boolean end = true;
for (int i = 0; i < pos.length; i++) {
System.out.print(t[i].get(pos[i]));
end = end && t[i].size() - 1 == pos[i];
}
System.out.println();
return end;
}}
添加回答
舉報(bào)
0/150
提交
取消