java 无序_Java比较无序的ArrayLists

先排序吧.

public boolean equalLists(List one,List two){

if (one == null && two == null){

return true;

}

if((one == null && two != null)

|| one != null && two == null

|| one.size() != two.size()){

return false;

}

//to avoid messing the order of the lists we will use a copy

//as noted in comments by A. R. S.

one = new ArrayList(one);

two = new ArrayList(two);

Collections.sort(one);

Collections.sort(two);

return one.equals(two);

}

老实说,你应该检查你的数据结构决定.这似乎更像是一个问题.排序然后比较将采用O(nlog n),而HashSet比较将仅为O(n).