java 壹道算法題，阿裏面試的題，我同學給我的，希望有人解答下？

HashMap<String, Object> ihp = new LinkedHashMap<String, Object>();

自定義壹個類

static class MyMap

{

List[] lists;

public MyMap(List... lists)

{

this.lists = lists;

}

public String toString()

{

if (lists == null || lists.length == 0)

{

return "{}";

}

StringBuilder sb = new StringBuilder();

sb.append('{');

int i = 0;

for (List list: lists)

{

sb.append(list);

i++;

if (i == lists.length)

return sb.append('}').toString();

sb.append(",");

}

return "{}";

}

}

ihp.put("on1",new MyMap(list2,list1));

ihp.put("on2",new MyMap(list4,list3));

ihp.put("on3",new MyMap(list5));

ihp.put("on4",new MyMap(list6));

System.out.println(ihp.toString());

估計有更好的辦法，最開始想到的是List[],發現打印出來是[[xxx,xxx,xxx],[xx,x,x]]這種結構