【算法题】两个有序数组的交集

public class JiaoJi {
    static List<Integer> list1 = Lists.newArrayList(1, 2, 3, 3, 4, 6, 7, 7, 8, 9, 12);
    static List<Integer> list2 = Lists.newArrayList(3, 3, 4, 5, 6, 6, 10, 10, 13);

    public static void main(String[] args) {
        int i = 0;
        int j = 0;
        if (list1 == null || list2 == null || list1.size() == 0 || list2.size() == 0) {
            return;
        }

        List<Integer> resultList = new ArrayList<>();

        while (i < list1.size() && j < list2.size()) {
            if (list1.get(i) > list2.get(j)) {
                j++;
                continue;
            } else if (list1.get(i) < list2.get(j)) {
                i++;
                continue;
            }

            if (list1.get(i).equals(list2.get(j))) {
                resultList.add(list1.get(i));
            }
            i++;
            j++;
        }

        System.out.println(resultList);
    }

}