比较Java中两个arrayList的元素

仅在长度较大的第一个arraylist上进行迭代，并在第二个arraylist中检查是否 包含 ，如果找到则另作任何设置

for(int counter = 0; counter < firstList.size(); counter++) {    if(secondList.contains(firstList.get(counter))) {          comparingList.set(counter,1);      }  }

整个java程序

只需尝试在http://www.compileonline.com/compile_java_online.php中运行以下程序

import java.util.ArrayList;import java.util.List;public class CompareArrayListTest{ public static void main(String[] args) {    ArrayList<String> firstList = new ArrayList<String>();    firstList.add("book1");    firstList.add("book2");    firstList.add("book3");    firstList.add("book4");    ArrayList<String> secondList = new ArrayList<String>();    secondList.add("book1");    secondList.add("book2");    secondList.add("book3");    List<Integer> comparingList = new ArrayList<Integer>();    // adding default values as one    for (int a = 0; a < firstList.size(); a++) {        comparingList.add(0);    }    for (int counter = 0; counter < firstList.size(); counter++) {        if (secondList.contains(firstList.get(counter))) { comparingList.set(counter, 1);        }    }    System.out.println(comparingList);}

BitSet bitset = new BitSet();// adding default values as onefor (int a = 0; a < firstList.size(); a++) {    comparingList.add(0);}for (int counter = 0; counter < firstList.size(); counter++) {    for (int counter2 = 0; counter < secondList.size(); counter++) {        if (secondList.get(counter2).equals(firstList.get(counter))) { bitset.set(counter, 1);        }    }}